141.17/119.30 YES 141.17/119.30 141.27/119.30 Ultimate: Cannot open display: 141.27/119.30 This is Ultimate 0.1.24-8dc7c08-m 141.27/119.30 [2019-03-28 12:40:15,168 INFO L170 SettingsManager]: Resetting all preferences to default values... 141.27/119.30 [2019-03-28 12:40:15,170 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 141.27/119.30 [2019-03-28 12:40:15,182 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 141.27/119.30 [2019-03-28 12:40:15,182 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 141.27/119.30 [2019-03-28 12:40:15,183 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 141.27/119.30 [2019-03-28 12:40:15,184 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 141.27/119.30 [2019-03-28 12:40:15,186 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 141.27/119.30 [2019-03-28 12:40:15,187 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 141.27/119.30 [2019-03-28 12:40:15,188 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 141.27/119.30 [2019-03-28 12:40:15,189 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 141.27/119.30 [2019-03-28 12:40:15,189 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 141.27/119.30 [2019-03-28 12:40:15,190 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 141.27/119.30 [2019-03-28 12:40:15,191 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 141.27/119.30 [2019-03-28 12:40:15,192 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 141.27/119.30 [2019-03-28 12:40:15,192 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 141.27/119.30 [2019-03-28 12:40:15,193 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 141.27/119.30 [2019-03-28 12:40:15,195 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 141.27/119.30 [2019-03-28 12:40:15,197 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 141.27/119.30 [2019-03-28 12:40:15,198 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 141.27/119.30 [2019-03-28 12:40:15,199 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 141.27/119.30 [2019-03-28 12:40:15,200 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 141.27/119.30 [2019-03-28 12:40:15,203 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 141.27/119.30 [2019-03-28 12:40:15,203 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 141.27/119.30 [2019-03-28 12:40:15,203 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 141.27/119.30 [2019-03-28 12:40:15,204 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 141.27/119.30 [2019-03-28 12:40:15,204 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 141.27/119.30 [2019-03-28 12:40:15,205 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 141.27/119.30 [2019-03-28 12:40:15,205 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 141.27/119.30 [2019-03-28 12:40:15,206 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 141.27/119.30 [2019-03-28 12:40:15,207 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 141.27/119.30 [2019-03-28 12:40:15,208 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 141.27/119.30 [2019-03-28 12:40:15,209 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 141.27/119.30 [2019-03-28 12:40:15,209 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 141.27/119.30 [2019-03-28 12:40:15,209 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 141.27/119.30 [2019-03-28 12:40:15,210 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 141.27/119.30 [2019-03-28 12:40:15,210 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 141.27/119.30 [2019-03-28 12:40:15,211 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 141.27/119.30 [2019-03-28 12:40:15,211 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 141.27/119.30 [2019-03-28 12:40:15,212 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 141.27/119.30 [2019-03-28 12:40:15,227 INFO L110 SettingsManager]: Loading preferences was successful 141.27/119.30 [2019-03-28 12:40:15,227 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 141.27/119.30 [2019-03-28 12:40:15,228 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 141.27/119.30 [2019-03-28 12:40:15,228 INFO L133 SettingsManager]: * Rewrite not-equals=true 141.27/119.30 [2019-03-28 12:40:15,228 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 141.27/119.30 [2019-03-28 12:40:15,229 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 141.27/119.30 [2019-03-28 12:40:15,229 INFO L133 SettingsManager]: * Use SBE=true 141.27/119.30 [2019-03-28 12:40:15,229 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 141.27/119.30 [2019-03-28 12:40:15,229 INFO L133 SettingsManager]: * Use old map elimination=false 141.27/119.30 [2019-03-28 12:40:15,229 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 141.27/119.30 [2019-03-28 12:40:15,230 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 141.27/119.30 [2019-03-28 12:40:15,230 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 141.27/119.30 [2019-03-28 12:40:15,230 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 141.27/119.30 [2019-03-28 12:40:15,230 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 141.27/119.30 [2019-03-28 12:40:15,230 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 141.27/119.30 [2019-03-28 12:40:15,231 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 141.27/119.30 [2019-03-28 12:40:15,231 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 141.27/119.30 [2019-03-28 12:40:15,231 INFO L133 SettingsManager]: * Check division by zero=IGNORE 141.27/119.30 [2019-03-28 12:40:15,231 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 141.27/119.30 [2019-03-28 12:40:15,231 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 141.27/119.30 [2019-03-28 12:40:15,232 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 141.27/119.30 [2019-03-28 12:40:15,232 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 141.27/119.30 [2019-03-28 12:40:15,232 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 141.27/119.30 [2019-03-28 12:40:15,232 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 141.27/119.30 [2019-03-28 12:40:15,232 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 141.27/119.30 [2019-03-28 12:40:15,233 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 141.27/119.30 [2019-03-28 12:40:15,233 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 141.27/119.30 [2019-03-28 12:40:15,233 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 141.27/119.30 [2019-03-28 12:40:15,233 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 141.27/119.30 [2019-03-28 12:40:15,259 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 141.27/119.30 [2019-03-28 12:40:15,272 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 141.27/119.30 [2019-03-28 12:40:15,276 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 141.27/119.30 [2019-03-28 12:40:15,277 INFO L271 PluginConnector]: Initializing CDTParser... 141.27/119.30 [2019-03-28 12:40:15,277 INFO L276 PluginConnector]: CDTParser initialized 141.27/119.30 [2019-03-28 12:40:15,278 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 141.27/119.30 [2019-03-28 12:40:15,340 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/a29c4b87c7ce4eb7a93bb0a16289c769/FLAG93e2280dc 141.27/119.30 [2019-03-28 12:40:15,684 INFO L307 CDTParser]: Found 1 translation units. 141.27/119.30 [2019-03-28 12:40:15,684 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 141.27/119.30 [2019-03-28 12:40:15,685 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 141.27/119.30 [2019-03-28 12:40:15,691 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/a29c4b87c7ce4eb7a93bb0a16289c769/FLAG93e2280dc 141.27/119.30 [2019-03-28 12:40:16,088 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/a29c4b87c7ce4eb7a93bb0a16289c769 141.27/119.30 [2019-03-28 12:40:16,099 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 141.27/119.30 [2019-03-28 12:40:16,101 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 141.27/119.30 [2019-03-28 12:40:16,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 141.27/119.30 [2019-03-28 12:40:16,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 141.27/119.30 [2019-03-28 12:40:16,105 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 141.27/119.30 [2019-03-28 12:40:16,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:40:16" (1/1) ... 141.27/119.30 [2019-03-28 12:40:16,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34a4d8ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:16, skipping insertion in model container 141.27/119.30 [2019-03-28 12:40:16,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:40:16" (1/1) ... 141.27/119.30 [2019-03-28 12:40:16,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 141.27/119.30 [2019-03-28 12:40:16,135 INFO L176 MainTranslator]: Built tables and reachable declarations 141.27/119.30 [2019-03-28 12:40:16,300 INFO L206 PostProcessor]: Analyzing one entry point: main 141.27/119.30 [2019-03-28 12:40:16,314 INFO L191 MainTranslator]: Completed pre-run 141.27/119.30 [2019-03-28 12:40:16,394 INFO L206 PostProcessor]: Analyzing one entry point: main 141.27/119.30 [2019-03-28 12:40:16,411 INFO L195 MainTranslator]: Completed translation 141.27/119.30 [2019-03-28 12:40:16,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:16 WrapperNode 141.27/119.30 [2019-03-28 12:40:16,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 141.27/119.30 [2019-03-28 12:40:16,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 141.27/119.30 [2019-03-28 12:40:16,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 141.27/119.30 [2019-03-28 12:40:16,413 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 141.27/119.30 [2019-03-28 12:40:16,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:16" (1/1) ... 141.27/119.30 [2019-03-28 12:40:16,433 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:16" (1/1) ... 141.27/119.30 [2019-03-28 12:40:16,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 141.27/119.30 [2019-03-28 12:40:16,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 141.27/119.30 [2019-03-28 12:40:16,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 141.27/119.30 [2019-03-28 12:40:16,458 INFO L276 PluginConnector]: Boogie Preprocessor initialized 141.27/119.30 [2019-03-28 12:40:16,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:16" (1/1) ... 141.27/119.30 [2019-03-28 12:40:16,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:16" (1/1) ... 141.27/119.30 [2019-03-28 12:40:16,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:16" (1/1) ... 141.27/119.30 [2019-03-28 12:40:16,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:16" (1/1) ... 141.27/119.30 [2019-03-28 12:40:16,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:16" (1/1) ... 141.27/119.30 [2019-03-28 12:40:16,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:16" (1/1) ... 141.27/119.30 [2019-03-28 12:40:16,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:16" (1/1) ... 141.27/119.30 [2019-03-28 12:40:16,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 141.27/119.30 [2019-03-28 12:40:16,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 141.27/119.30 [2019-03-28 12:40:16,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... 141.27/119.30 [2019-03-28 12:40:16,484 INFO L276 PluginConnector]: RCFGBuilder initialized 141.27/119.30 [2019-03-28 12:40:16,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:16" (1/1) ... 141.27/119.30 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 141.27/119.30 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 141.27/119.30 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 141.27/119.30 [2019-03-28 12:40:16,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 141.27/119.30 [2019-03-28 12:40:16,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 141.27/119.30 [2019-03-28 12:40:16,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 141.27/119.30 [2019-03-28 12:40:16,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 141.27/119.30 [2019-03-28 12:40:16,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 141.27/119.30 [2019-03-28 12:40:16,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 141.27/119.30 [2019-03-28 12:40:16,847 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 141.27/119.30 [2019-03-28 12:40:16,847 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 141.27/119.30 [2019-03-28 12:40:16,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:16 BoogieIcfgContainer 141.27/119.30 [2019-03-28 12:40:16,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 141.27/119.30 [2019-03-28 12:40:16,849 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 141.27/119.30 [2019-03-28 12:40:16,850 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 141.27/119.30 [2019-03-28 12:40:16,852 INFO L276 PluginConnector]: BlockEncodingV2 initialized 141.27/119.30 [2019-03-28 12:40:16,853 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:16" (1/1) ... 141.27/119.30 [2019-03-28 12:40:16,873 INFO L313 BlockEncoder]: Initial Icfg 50 locations, 52 edges 141.27/119.30 [2019-03-28 12:40:16,875 INFO L258 BlockEncoder]: Using Remove infeasible edges 141.27/119.30 [2019-03-28 12:40:16,876 INFO L263 BlockEncoder]: Using Maximize final states 141.27/119.30 [2019-03-28 12:40:16,877 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 141.27/119.30 [2019-03-28 12:40:16,877 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 141.27/119.30 [2019-03-28 12:40:16,879 INFO L296 BlockEncoder]: Using Remove sink states 141.27/119.30 [2019-03-28 12:40:16,880 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 141.27/119.30 [2019-03-28 12:40:16,880 INFO L179 BlockEncoder]: Using Rewrite not-equals 141.27/119.30 [2019-03-28 12:40:16,907 INFO L185 BlockEncoder]: Using Use SBE 141.27/119.30 [2019-03-28 12:40:16,944 INFO L200 BlockEncoder]: SBE split 27 edges 141.27/119.30 [2019-03-28 12:40:16,950 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 141.27/119.30 [2019-03-28 12:40:16,952 INFO L71 MaximizeFinalStates]: 0 new accepting states 141.27/119.30 [2019-03-28 12:40:16,986 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 141.27/119.30 [2019-03-28 12:40:16,989 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 141.27/119.30 [2019-03-28 12:40:16,991 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 141.27/119.30 [2019-03-28 12:40:16,991 INFO L71 MaximizeFinalStates]: 0 new accepting states 141.27/119.30 [2019-03-28 12:40:16,991 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 141.27/119.30 [2019-03-28 12:40:16,992 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 141.27/119.30 [2019-03-28 12:40:16,992 INFO L313 BlockEncoder]: Encoded RCFG 42 locations, 76 edges 141.27/119.30 [2019-03-28 12:40:16,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:40:16 BasicIcfg 141.27/119.30 [2019-03-28 12:40:16,993 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 141.27/119.30 [2019-03-28 12:40:16,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 141.27/119.30 [2019-03-28 12:40:16,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... 141.27/119.30 [2019-03-28 12:40:16,998 INFO L276 PluginConnector]: TraceAbstraction initialized 141.27/119.30 [2019-03-28 12:40:16,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:40:16" (1/4) ... 141.27/119.30 [2019-03-28 12:40:16,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ff26d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:40:16, skipping insertion in model container 141.27/119.30 [2019-03-28 12:40:16,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:16" (2/4) ... 141.27/119.30 [2019-03-28 12:40:16,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ff26d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:40:16, skipping insertion in model container 141.27/119.30 [2019-03-28 12:40:17,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:16" (3/4) ... 141.27/119.30 [2019-03-28 12:40:17,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ff26d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:40:17, skipping insertion in model container 141.27/119.30 [2019-03-28 12:40:17,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:40:16" (4/4) ... 141.27/119.30 [2019-03-28 12:40:17,002 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 141.27/119.30 [2019-03-28 12:40:17,012 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 141.27/119.30 [2019-03-28 12:40:17,021 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 24 error locations. 141.27/119.30 [2019-03-28 12:40:17,038 INFO L257 AbstractCegarLoop]: Starting to check reachability of 24 error locations. 141.27/119.30 [2019-03-28 12:40:17,067 INFO L133 ementStrategyFactory]: Using default assertion order modulation 141.27/119.30 [2019-03-28 12:40:17,068 INFO L382 AbstractCegarLoop]: Interprodecural is true 141.27/119.30 [2019-03-28 12:40:17,068 INFO L383 AbstractCegarLoop]: Hoare is true 141.27/119.30 [2019-03-28 12:40:17,068 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 141.27/119.30 [2019-03-28 12:40:17,068 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 141.27/119.30 [2019-03-28 12:40:17,069 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 141.27/119.30 [2019-03-28 12:40:17,069 INFO L387 AbstractCegarLoop]: Difference is false 141.27/119.30 [2019-03-28 12:40:17,069 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 141.27/119.30 [2019-03-28 12:40:17,069 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 141.27/119.30 [2019-03-28 12:40:17,085 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. 141.27/119.30 [2019-03-28 12:40:17,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 141.27/119.30 [2019-03-28 12:40:17,091 INFO L394 BasicCegarLoop]: Found error trace 141.27/119.30 [2019-03-28 12:40:17,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 141.27/119.30 [2019-03-28 12:40:17,093 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION]=== 141.27/119.30 [2019-03-28 12:40:17,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.30 [2019-03-28 12:40:17,098 INFO L82 PathProgramCache]: Analyzing trace with hash 116188, now seen corresponding path program 1 times 141.27/119.30 [2019-03-28 12:40:17,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 141.27/119.30 [2019-03-28 12:40:17,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 141.27/119.30 [2019-03-28 12:40:17,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.30 [2019-03-28 12:40:17,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 141.27/119.30 [2019-03-28 12:40:17,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.30 [2019-03-28 12:40:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.30 [2019-03-28 12:40:17,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 141.27/119.30 [2019-03-28 12:40:17,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 141.27/119.30 [2019-03-28 12:40:17,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 141.27/119.30 [2019-03-28 12:40:17,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 141.27/119.30 [2019-03-28 12:40:17,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 141.27/119.30 [2019-03-28 12:40:17,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 141.27/119.30 [2019-03-28 12:40:17,310 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. 141.27/119.30 [2019-03-28 12:40:17,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 141.27/119.30 [2019-03-28 12:40:17,477 INFO L93 Difference]: Finished difference Result 42 states and 76 transitions. 141.27/119.30 [2019-03-28 12:40:17,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 141.27/119.30 [2019-03-28 12:40:17,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 141.27/119.30 [2019-03-28 12:40:17,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 141.27/119.30 [2019-03-28 12:40:17,493 INFO L225 Difference]: With dead ends: 42 141.27/119.30 [2019-03-28 12:40:17,493 INFO L226 Difference]: Without dead ends: 38 141.27/119.30 [2019-03-28 12:40:17,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 141.27/119.30 [2019-03-28 12:40:17,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. 141.27/119.30 [2019-03-28 12:40:17,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. 141.27/119.30 [2019-03-28 12:40:17,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. 141.27/119.30 [2019-03-28 12:40:17,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 68 transitions. 141.27/119.30 [2019-03-28 12:40:17,538 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 68 transitions. Word has length 3 141.27/119.30 [2019-03-28 12:40:17,539 INFO L84 Accepts]: Finished accepts. word is rejected. 141.27/119.30 [2019-03-28 12:40:17,540 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 68 transitions. 141.27/119.30 [2019-03-28 12:40:17,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 141.27/119.30 [2019-03-28 12:40:17,540 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 68 transitions. 141.27/119.30 [2019-03-28 12:40:17,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 141.27/119.30 [2019-03-28 12:40:17,540 INFO L394 BasicCegarLoop]: Found error trace 141.27/119.30 [2019-03-28 12:40:17,541 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 141.27/119.30 [2019-03-28 12:40:17,541 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION]=== 141.27/119.30 [2019-03-28 12:40:17,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.30 [2019-03-28 12:40:17,541 INFO L82 PathProgramCache]: Analyzing trace with hash 116190, now seen corresponding path program 1 times 141.27/119.30 [2019-03-28 12:40:17,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 141.27/119.30 [2019-03-28 12:40:17,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 141.27/119.30 [2019-03-28 12:40:17,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.30 [2019-03-28 12:40:17,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 141.27/119.30 [2019-03-28 12:40:17,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.30 [2019-03-28 12:40:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.30 [2019-03-28 12:40:17,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 141.27/119.30 [2019-03-28 12:40:17,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 141.27/119.30 [2019-03-28 12:40:17,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 141.27/119.30 [2019-03-28 12:40:17,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 141.27/119.30 [2019-03-28 12:40:17,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 141.27/119.30 [2019-03-28 12:40:17,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 141.27/119.30 [2019-03-28 12:40:17,572 INFO L87 Difference]: Start difference. First operand 38 states and 68 transitions. Second operand 3 states. 141.27/119.30 [2019-03-28 12:40:17,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 141.27/119.30 [2019-03-28 12:40:17,675 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. 141.27/119.30 [2019-03-28 12:40:17,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 141.27/119.30 [2019-03-28 12:40:17,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 141.27/119.30 [2019-03-28 12:40:17,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 141.27/119.30 [2019-03-28 12:40:17,740 INFO L225 Difference]: With dead ends: 42 141.27/119.30 [2019-03-28 12:40:17,740 INFO L226 Difference]: Without dead ends: 38 141.27/119.30 [2019-03-28 12:40:17,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 141.27/119.30 [2019-03-28 12:40:17,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. 141.27/119.30 [2019-03-28 12:40:17,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. 141.27/119.30 [2019-03-28 12:40:17,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. 141.27/119.30 [2019-03-28 12:40:17,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. 141.27/119.30 [2019-03-28 12:40:17,747 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 3 141.27/119.30 [2019-03-28 12:40:17,748 INFO L84 Accepts]: Finished accepts. word is rejected. 141.27/119.30 [2019-03-28 12:40:17,748 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. 141.27/119.30 [2019-03-28 12:40:17,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 141.27/119.30 [2019-03-28 12:40:17,748 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. 141.27/119.30 [2019-03-28 12:40:17,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 141.27/119.30 [2019-03-28 12:40:17,748 INFO L394 BasicCegarLoop]: Found error trace 141.27/119.30 [2019-03-28 12:40:17,749 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 141.27/119.30 [2019-03-28 12:40:17,749 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION]=== 141.27/119.30 [2019-03-28 12:40:17,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.30 [2019-03-28 12:40:17,749 INFO L82 PathProgramCache]: Analyzing trace with hash 116191, now seen corresponding path program 1 times 141.27/119.30 [2019-03-28 12:40:17,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 141.27/119.30 [2019-03-28 12:40:17,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 141.27/119.30 [2019-03-28 12:40:17,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.30 [2019-03-28 12:40:17,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 141.27/119.30 [2019-03-28 12:40:17,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.30 [2019-03-28 12:40:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.30 [2019-03-28 12:40:17,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 141.27/119.30 [2019-03-28 12:40:17,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 141.27/119.30 [2019-03-28 12:40:17,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 141.27/119.30 [2019-03-28 12:40:17,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 141.27/119.30 [2019-03-28 12:40:17,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 141.27/119.30 [2019-03-28 12:40:17,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 141.27/119.30 [2019-03-28 12:40:17,804 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand 3 states. 141.27/119.30 [2019-03-28 12:40:17,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 141.27/119.30 [2019-03-28 12:40:17,901 INFO L93 Difference]: Finished difference Result 38 states and 64 transitions. 141.27/119.30 [2019-03-28 12:40:17,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 141.27/119.30 [2019-03-28 12:40:17,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 141.27/119.30 [2019-03-28 12:40:17,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 141.27/119.30 [2019-03-28 12:40:17,902 INFO L225 Difference]: With dead ends: 38 141.27/119.30 [2019-03-28 12:40:17,902 INFO L226 Difference]: Without dead ends: 34 141.27/119.30 [2019-03-28 12:40:17,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 141.27/119.30 [2019-03-28 12:40:17,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. 141.27/119.30 [2019-03-28 12:40:17,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. 141.27/119.30 [2019-03-28 12:40:17,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 141.27/119.30 [2019-03-28 12:40:17,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 60 transitions. 141.27/119.30 [2019-03-28 12:40:17,908 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 60 transitions. Word has length 3 141.27/119.30 [2019-03-28 12:40:17,908 INFO L84 Accepts]: Finished accepts. word is rejected. 141.27/119.30 [2019-03-28 12:40:17,908 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 60 transitions. 141.27/119.30 [2019-03-28 12:40:17,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 141.27/119.30 [2019-03-28 12:40:17,908 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 60 transitions. 141.27/119.30 [2019-03-28 12:40:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 141.27/119.30 [2019-03-28 12:40:17,909 INFO L394 BasicCegarLoop]: Found error trace 141.27/119.30 [2019-03-28 12:40:17,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 141.27/119.30 [2019-03-28 12:40:17,909 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION]=== 141.27/119.30 [2019-03-28 12:40:17,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.30 [2019-03-28 12:40:17,910 INFO L82 PathProgramCache]: Analyzing trace with hash 3599384, now seen corresponding path program 1 times 141.27/119.30 [2019-03-28 12:40:17,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 141.27/119.30 [2019-03-28 12:40:17,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 141.27/119.30 [2019-03-28 12:40:17,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.30 [2019-03-28 12:40:17,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 141.27/119.30 [2019-03-28 12:40:17,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.30 [2019-03-28 12:40:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.30 [2019-03-28 12:40:17,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 141.27/119.30 [2019-03-28 12:40:17,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 141.27/119.30 [2019-03-28 12:40:17,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 141.27/119.30 [2019-03-28 12:40:17,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 141.27/119.30 [2019-03-28 12:40:17,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 141.27/119.30 [2019-03-28 12:40:17,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 141.27/119.30 [2019-03-28 12:40:17,948 INFO L87 Difference]: Start difference. First operand 34 states and 60 transitions. Second operand 3 states. 141.27/119.30 [2019-03-28 12:40:18,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 141.27/119.30 [2019-03-28 12:40:18,048 INFO L93 Difference]: Finished difference Result 34 states and 60 transitions. 141.27/119.30 [2019-03-28 12:40:18,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 141.27/119.30 [2019-03-28 12:40:18,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 141.27/119.30 [2019-03-28 12:40:18,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 141.27/119.30 [2019-03-28 12:40:18,051 INFO L225 Difference]: With dead ends: 34 141.27/119.30 [2019-03-28 12:40:18,051 INFO L226 Difference]: Without dead ends: 30 141.27/119.30 [2019-03-28 12:40:18,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 141.27/119.30 [2019-03-28 12:40:18,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 141.27/119.30 [2019-03-28 12:40:18,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. 141.27/119.30 [2019-03-28 12:40:18,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 141.27/119.30 [2019-03-28 12:40:18,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 52 transitions. 141.27/119.30 [2019-03-28 12:40:18,055 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 52 transitions. Word has length 4 141.27/119.30 [2019-03-28 12:40:18,056 INFO L84 Accepts]: Finished accepts. word is rejected. 141.27/119.30 [2019-03-28 12:40:18,056 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 52 transitions. 141.27/119.30 [2019-03-28 12:40:18,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 141.27/119.30 [2019-03-28 12:40:18,056 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 52 transitions. 141.27/119.30 [2019-03-28 12:40:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 141.27/119.30 [2019-03-28 12:40:18,056 INFO L394 BasicCegarLoop]: Found error trace 141.27/119.30 [2019-03-28 12:40:18,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 141.27/119.30 [2019-03-28 12:40:18,057 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION]=== 141.27/119.30 [2019-03-28 12:40:18,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.30 [2019-03-28 12:40:18,057 INFO L82 PathProgramCache]: Analyzing trace with hash 3599385, now seen corresponding path program 1 times 141.27/119.30 [2019-03-28 12:40:18,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 141.27/119.30 [2019-03-28 12:40:18,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 141.27/119.30 [2019-03-28 12:40:18,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.30 [2019-03-28 12:40:18,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 141.27/119.30 [2019-03-28 12:40:18,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.30 [2019-03-28 12:40:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.30 [2019-03-28 12:40:18,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 141.27/119.30 [2019-03-28 12:40:18,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 141.27/119.30 [2019-03-28 12:40:18,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 141.27/119.30 [2019-03-28 12:40:18,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 141.27/119.30 [2019-03-28 12:40:18,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 141.27/119.30 [2019-03-28 12:40:18,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 141.27/119.30 [2019-03-28 12:40:18,083 INFO L87 Difference]: Start difference. First operand 30 states and 52 transitions. Second operand 3 states. 141.27/119.30 [2019-03-28 12:40:18,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 141.27/119.30 [2019-03-28 12:40:18,170 INFO L93 Difference]: Finished difference Result 34 states and 52 transitions. 141.27/119.30 [2019-03-28 12:40:18,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 141.27/119.30 [2019-03-28 12:40:18,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 141.27/119.30 [2019-03-28 12:40:18,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 141.27/119.30 [2019-03-28 12:40:18,172 INFO L225 Difference]: With dead ends: 34 141.27/119.30 [2019-03-28 12:40:18,172 INFO L226 Difference]: Without dead ends: 30 141.27/119.30 [2019-03-28 12:40:18,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 141.27/119.30 [2019-03-28 12:40:18,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 141.27/119.30 [2019-03-28 12:40:18,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. 141.27/119.30 [2019-03-28 12:40:18,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 141.27/119.30 [2019-03-28 12:40:18,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 48 transitions. 141.27/119.30 [2019-03-28 12:40:18,177 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 48 transitions. Word has length 4 141.27/119.30 [2019-03-28 12:40:18,177 INFO L84 Accepts]: Finished accepts. word is rejected. 141.27/119.30 [2019-03-28 12:40:18,177 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 48 transitions. 141.27/119.30 [2019-03-28 12:40:18,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 141.27/119.30 [2019-03-28 12:40:18,177 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 48 transitions. 141.27/119.30 [2019-03-28 12:40:18,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 141.27/119.30 [2019-03-28 12:40:18,178 INFO L394 BasicCegarLoop]: Found error trace 141.27/119.30 [2019-03-28 12:40:18,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 141.27/119.30 [2019-03-28 12:40:18,178 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION]=== 141.27/119.30 [2019-03-28 12:40:18,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.30 [2019-03-28 12:40:18,179 INFO L82 PathProgramCache]: Analyzing trace with hash 3599386, now seen corresponding path program 1 times 141.27/119.30 [2019-03-28 12:40:18,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 141.27/119.30 [2019-03-28 12:40:18,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 141.27/119.30 [2019-03-28 12:40:18,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.30 [2019-03-28 12:40:18,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 141.27/119.30 [2019-03-28 12:40:18,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.30 [2019-03-28 12:40:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.30 [2019-03-28 12:40:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 141.27/119.30 [2019-03-28 12:40:18,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 141.27/119.31 [2019-03-28 12:40:18,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 141.27/119.31 [2019-03-28 12:40:18,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 141.27/119.31 [2019-03-28 12:40:18,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 141.27/119.31 [2019-03-28 12:40:18,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 141.27/119.31 [2019-03-28 12:40:18,215 INFO L87 Difference]: Start difference. First operand 30 states and 48 transitions. Second operand 3 states. 141.27/119.31 [2019-03-28 12:40:18,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 141.27/119.31 [2019-03-28 12:40:18,285 INFO L93 Difference]: Finished difference Result 30 states and 48 transitions. 141.27/119.31 [2019-03-28 12:40:18,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 141.27/119.31 [2019-03-28 12:40:18,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 141.27/119.31 [2019-03-28 12:40:18,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 141.27/119.31 [2019-03-28 12:40:18,287 INFO L225 Difference]: With dead ends: 30 141.27/119.31 [2019-03-28 12:40:18,287 INFO L226 Difference]: Without dead ends: 26 141.27/119.31 [2019-03-28 12:40:18,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 141.27/119.31 [2019-03-28 12:40:18,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 141.27/119.31 [2019-03-28 12:40:18,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 141.27/119.31 [2019-03-28 12:40:18,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 141.27/119.31 [2019-03-28 12:40:18,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 44 transitions. 141.27/119.31 [2019-03-28 12:40:18,291 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 44 transitions. Word has length 4 141.27/119.31 [2019-03-28 12:40:18,291 INFO L84 Accepts]: Finished accepts. word is rejected. 141.27/119.31 [2019-03-28 12:40:18,291 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 44 transitions. 141.27/119.31 [2019-03-28 12:40:18,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 141.27/119.31 [2019-03-28 12:40:18,291 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 44 transitions. 141.27/119.31 [2019-03-28 12:40:18,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 141.27/119.31 [2019-03-28 12:40:18,292 INFO L394 BasicCegarLoop]: Found error trace 141.27/119.31 [2019-03-28 12:40:18,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 141.27/119.31 [2019-03-28 12:40:18,292 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION]=== 141.27/119.31 [2019-03-28 12:40:18,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.31 [2019-03-28 12:40:18,292 INFO L82 PathProgramCache]: Analyzing trace with hash 111579517, now seen corresponding path program 1 times 141.27/119.31 [2019-03-28 12:40:18,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 141.27/119.31 [2019-03-28 12:40:18,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 141.27/119.31 [2019-03-28 12:40:18,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.31 [2019-03-28 12:40:18,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 141.27/119.31 [2019-03-28 12:40:18,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 141.27/119.31 [2019-03-28 12:40:18,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 141.27/119.31 [2019-03-28 12:40:18,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 141.27/119.31 [2019-03-28 12:40:18,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 141.27/119.31 [2019-03-28 12:40:18,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 141.27/119.31 [2019-03-28 12:40:18,325 INFO L87 Difference]: Start difference. First operand 26 states and 44 transitions. Second operand 3 states. 141.27/119.31 [2019-03-28 12:40:18,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 141.27/119.31 [2019-03-28 12:40:18,393 INFO L93 Difference]: Finished difference Result 26 states and 44 transitions. 141.27/119.31 [2019-03-28 12:40:18,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 141.27/119.31 [2019-03-28 12:40:18,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 141.27/119.31 [2019-03-28 12:40:18,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 141.27/119.31 [2019-03-28 12:40:18,394 INFO L225 Difference]: With dead ends: 26 141.27/119.31 [2019-03-28 12:40:18,394 INFO L226 Difference]: Without dead ends: 22 141.27/119.31 [2019-03-28 12:40:18,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 141.27/119.31 [2019-03-28 12:40:18,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 141.27/119.31 [2019-03-28 12:40:18,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 141.27/119.31 [2019-03-28 12:40:18,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 141.27/119.31 [2019-03-28 12:40:18,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. 141.27/119.31 [2019-03-28 12:40:18,398 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 36 transitions. Word has length 5 141.27/119.31 [2019-03-28 12:40:18,398 INFO L84 Accepts]: Finished accepts. word is rejected. 141.27/119.31 [2019-03-28 12:40:18,398 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 36 transitions. 141.27/119.31 [2019-03-28 12:40:18,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 141.27/119.31 [2019-03-28 12:40:18,399 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 36 transitions. 141.27/119.31 [2019-03-28 12:40:18,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 141.27/119.31 [2019-03-28 12:40:18,399 INFO L394 BasicCegarLoop]: Found error trace 141.27/119.31 [2019-03-28 12:40:18,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 141.27/119.31 [2019-03-28 12:40:18,399 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION]=== 141.27/119.31 [2019-03-28 12:40:18,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.31 [2019-03-28 12:40:18,400 INFO L82 PathProgramCache]: Analyzing trace with hash 111579519, now seen corresponding path program 1 times 141.27/119.31 [2019-03-28 12:40:18,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 141.27/119.31 [2019-03-28 12:40:18,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 141.27/119.31 [2019-03-28 12:40:18,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.31 [2019-03-28 12:40:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 141.27/119.31 [2019-03-28 12:40:18,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 141.27/119.31 [2019-03-28 12:40:18,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 141.27/119.31 [2019-03-28 12:40:18,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 141.27/119.31 [2019-03-28 12:40:18,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 141.27/119.31 [2019-03-28 12:40:18,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 141.27/119.31 [2019-03-28 12:40:18,424 INFO L87 Difference]: Start difference. First operand 22 states and 36 transitions. Second operand 3 states. 141.27/119.31 [2019-03-28 12:40:18,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 141.27/119.31 [2019-03-28 12:40:18,468 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. 141.27/119.31 [2019-03-28 12:40:18,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 141.27/119.31 [2019-03-28 12:40:18,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 141.27/119.31 [2019-03-28 12:40:18,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 141.27/119.31 [2019-03-28 12:40:18,469 INFO L225 Difference]: With dead ends: 26 141.27/119.31 [2019-03-28 12:40:18,469 INFO L226 Difference]: Without dead ends: 22 141.27/119.31 [2019-03-28 12:40:18,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 141.27/119.31 [2019-03-28 12:40:18,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 141.27/119.31 [2019-03-28 12:40:18,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 141.27/119.31 [2019-03-28 12:40:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 141.27/119.31 [2019-03-28 12:40:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. 141.27/119.31 [2019-03-28 12:40:18,473 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 5 141.27/119.31 [2019-03-28 12:40:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. 141.27/119.31 [2019-03-28 12:40:18,473 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. 141.27/119.31 [2019-03-28 12:40:18,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 141.27/119.31 [2019-03-28 12:40:18,473 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. 141.27/119.31 [2019-03-28 12:40:18,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 141.27/119.31 [2019-03-28 12:40:18,474 INFO L394 BasicCegarLoop]: Found error trace 141.27/119.31 [2019-03-28 12:40:18,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 141.27/119.31 [2019-03-28 12:40:18,474 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION]=== 141.27/119.31 [2019-03-28 12:40:18,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.31 [2019-03-28 12:40:18,474 INFO L82 PathProgramCache]: Analyzing trace with hash 111579520, now seen corresponding path program 1 times 141.27/119.31 [2019-03-28 12:40:18,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 141.27/119.31 [2019-03-28 12:40:18,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 141.27/119.31 [2019-03-28 12:40:18,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.31 [2019-03-28 12:40:18,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 141.27/119.31 [2019-03-28 12:40:18,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 141.27/119.31 [2019-03-28 12:40:18,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 141.27/119.31 [2019-03-28 12:40:18,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 141.27/119.31 [2019-03-28 12:40:18,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 141.27/119.31 [2019-03-28 12:40:18,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 141.27/119.31 [2019-03-28 12:40:18,506 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. 141.27/119.31 [2019-03-28 12:40:18,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 141.27/119.31 [2019-03-28 12:40:18,556 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. 141.27/119.31 [2019-03-28 12:40:18,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 141.27/119.31 [2019-03-28 12:40:18,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 141.27/119.31 [2019-03-28 12:40:18,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 141.27/119.31 [2019-03-28 12:40:18,557 INFO L225 Difference]: With dead ends: 22 141.27/119.31 [2019-03-28 12:40:18,557 INFO L226 Difference]: Without dead ends: 0 141.27/119.31 [2019-03-28 12:40:18,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 141.27/119.31 [2019-03-28 12:40:18,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 141.27/119.31 [2019-03-28 12:40:18,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 141.27/119.31 [2019-03-28 12:40:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 141.27/119.31 [2019-03-28 12:40:18,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 141.27/119.31 [2019-03-28 12:40:18,559 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 141.27/119.31 [2019-03-28 12:40:18,559 INFO L84 Accepts]: Finished accepts. word is rejected. 141.27/119.31 [2019-03-28 12:40:18,559 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 141.27/119.31 [2019-03-28 12:40:18,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 141.27/119.31 [2019-03-28 12:40:18,559 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 141.27/119.31 [2019-03-28 12:40:18,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 141.27/119.31 [2019-03-28 12:40:18,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 141.27/119.31 [2019-03-28 12:40:18,593 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,594 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,594 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,594 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,594 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,595 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,595 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,595 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,595 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,595 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,595 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,595 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,595 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,596 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,596 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,596 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,596 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,596 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,596 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,596 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,596 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,597 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,597 INFO L448 ceAbstractionStarter]: For program point L13-2(line 13) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,597 INFO L448 ceAbstractionStarter]: For program point L13-3(line 13) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,597 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,597 INFO L448 ceAbstractionStarter]: For program point L13-5(lines 13 17) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,597 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,598 INFO L444 ceAbstractionStarter]: At program point L13-7(lines 12 17) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base))) 141.27/119.31 [2019-03-28 12:40:18,598 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,598 INFO L448 ceAbstractionStarter]: For program point L13-8(lines 13 17) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,598 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,598 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,598 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,598 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,598 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,599 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,599 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,599 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,599 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,599 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,599 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,599 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. 141.27/119.31 [2019-03-28 12:40:18,600 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 141.27/119.31 [2019-03-28 12:40:18,609 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 141.27/119.31 [2019-03-28 12:40:18,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 141.27/119.31 [2019-03-28 12:40:18,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 141.27/119.31 [2019-03-28 12:40:18,617 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 141.27/119.31 [2019-03-28 12:40:18,617 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 141.27/119.31 [2019-03-28 12:40:18,617 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 141.27/119.31 [2019-03-28 12:40:18,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:40:18 BasicIcfg 141.27/119.31 [2019-03-28 12:40:18,620 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 141.27/119.31 [2019-03-28 12:40:18,621 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 141.27/119.31 [2019-03-28 12:40:18,621 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 141.27/119.31 [2019-03-28 12:40:18,624 INFO L276 PluginConnector]: BuchiAutomizer initialized 141.27/119.31 [2019-03-28 12:40:18,625 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 141.27/119.31 [2019-03-28 12:40:18,625 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:40:16" (1/5) ... 141.27/119.31 [2019-03-28 12:40:18,626 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d5ea9d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:40:18, skipping insertion in model container 141.27/119.31 [2019-03-28 12:40:18,626 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 141.27/119.31 [2019-03-28 12:40:18,626 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:16" (2/5) ... 141.27/119.31 [2019-03-28 12:40:18,626 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d5ea9d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:40:18, skipping insertion in model container 141.27/119.31 [2019-03-28 12:40:18,626 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 141.27/119.31 [2019-03-28 12:40:18,627 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:16" (3/5) ... 141.27/119.31 [2019-03-28 12:40:18,627 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d5ea9d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:40:18, skipping insertion in model container 141.27/119.31 [2019-03-28 12:40:18,627 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 141.27/119.31 [2019-03-28 12:40:18,627 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:40:16" (4/5) ... 141.27/119.31 [2019-03-28 12:40:18,627 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d5ea9d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:40:18, skipping insertion in model container 141.27/119.31 [2019-03-28 12:40:18,628 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 141.27/119.31 [2019-03-28 12:40:18,628 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:40:18" (5/5) ... 141.27/119.31 [2019-03-28 12:40:18,629 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 141.27/119.31 [2019-03-28 12:40:18,650 INFO L133 ementStrategyFactory]: Using default assertion order modulation 141.27/119.31 [2019-03-28 12:40:18,650 INFO L374 BuchiCegarLoop]: Interprodecural is true 141.27/119.31 [2019-03-28 12:40:18,650 INFO L375 BuchiCegarLoop]: Hoare is true 141.27/119.31 [2019-03-28 12:40:18,650 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 141.27/119.31 [2019-03-28 12:40:18,650 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 141.27/119.31 [2019-03-28 12:40:18,651 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 141.27/119.31 [2019-03-28 12:40:18,651 INFO L379 BuchiCegarLoop]: Difference is false 141.27/119.31 [2019-03-28 12:40:18,651 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 141.27/119.31 [2019-03-28 12:40:18,651 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 141.27/119.31 [2019-03-28 12:40:18,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states. 141.27/119.31 [2019-03-28 12:40:18,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 141.27/119.31 [2019-03-28 12:40:18,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 141.27/119.31 [2019-03-28 12:40:18,661 INFO L119 BuchiIsEmpty]: Starting construction of run 141.27/119.31 [2019-03-28 12:40:18,665 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 141.27/119.31 [2019-03-28 12:40:18,665 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 141.27/119.31 [2019-03-28 12:40:18,665 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 141.27/119.31 [2019-03-28 12:40:18,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states. 141.27/119.31 [2019-03-28 12:40:18,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 141.27/119.31 [2019-03-28 12:40:18,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 141.27/119.31 [2019-03-28 12:40:18,668 INFO L119 BuchiIsEmpty]: Starting construction of run 141.27/119.31 [2019-03-28 12:40:18,669 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 141.27/119.31 [2019-03-28 12:40:18,669 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 141.27/119.31 [2019-03-28 12:40:18,674 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue [85] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 13#L-1true [154] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 14#L10true [71] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 30#L10-1true [110] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 35#L11true [86] L11-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 7#L13-7true 141.27/119.31 [2019-03-28 12:40:18,675 INFO L796 eck$LassoCheckResult]: Loop: 7#L13-7true [104] L13-7-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 41#L13true [176] L13-->L13-1: Formula: (and (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short5_2|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 39#L13-1true [118] L13-1-->L13-5: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_5|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[] 9#L13-5true [108] L13-5-->L14: Formula: |v_ULTIMATE.start_test_fun_#t~short5_9| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 21#L14true [79] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{#valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 20#L14-1true [209] L14-1-->L15: Formula: (and (= (store |v_#memory_int_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_15 (store (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem6_6| (- 1)))) |v_#memory_int_21|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_31| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) InVars {#valid=|v_#valid_39|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_31|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{#valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_31|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem6] 24#L15true [82] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select |v_#valid_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) 1) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 44#L15-1true [212] L15-1-->L16: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select |v_#valid_44| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_34| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| (- 1)))) |v_#memory_int_25|)) InVars {#valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, #length=|v_#length_34|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_44|, #memory_int=|v_#memory_int_25|, #length=|v_#length_34|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 6#L16true [100] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_25| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 4#L16-1true [213] L16-1-->L13-7: Formula: (and (= (store |v_#memory_int_28| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_28| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| 1))) |v_#memory_int_27|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= 1 (select |v_#valid_45| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_28|, #length=|v_#length_35|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_27|, #length=|v_#length_35|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 7#L13-7true 141.27/119.31 [2019-03-28 12:40:18,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.31 [2019-03-28 12:40:18,676 INFO L82 PathProgramCache]: Analyzing trace with hash 111787977, now seen corresponding path program 1 times 141.27/119.31 [2019-03-28 12:40:18,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 141.27/119.31 [2019-03-28 12:40:18,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 141.27/119.31 [2019-03-28 12:40:18,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:40:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:40:18,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.31 [2019-03-28 12:40:18,725 INFO L82 PathProgramCache]: Analyzing trace with hash -2027217196, now seen corresponding path program 1 times 141.27/119.31 [2019-03-28 12:40:18,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 141.27/119.31 [2019-03-28 12:40:18,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 141.27/119.31 [2019-03-28 12:40:18,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.31 [2019-03-28 12:40:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 141.27/119.31 [2019-03-28 12:40:18,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 141.27/119.31 [2019-03-28 12:40:18,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 141.27/119.31 [2019-03-28 12:40:18,738 INFO L811 eck$LassoCheckResult]: loop already infeasible 141.27/119.31 [2019-03-28 12:40:18,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 141.27/119.31 [2019-03-28 12:40:18,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 141.27/119.31 [2019-03-28 12:40:18,740 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. 141.27/119.31 [2019-03-28 12:40:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 141.27/119.31 [2019-03-28 12:40:18,853 INFO L93 Difference]: Finished difference Result 44 states and 78 transitions. 141.27/119.31 [2019-03-28 12:40:18,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 141.27/119.31 [2019-03-28 12:40:18,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 78 transitions. 141.27/119.31 [2019-03-28 12:40:18,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 141.27/119.31 [2019-03-28 12:40:18,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 19 states and 29 transitions. 141.27/119.31 [2019-03-28 12:40:18,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 141.27/119.31 [2019-03-28 12:40:18,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 141.27/119.31 [2019-03-28 12:40:18,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 29 transitions. 141.27/119.31 [2019-03-28 12:40:18,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 141.27/119.31 [2019-03-28 12:40:18,862 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 29 transitions. 141.27/119.31 [2019-03-28 12:40:18,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 29 transitions. 141.27/119.31 [2019-03-28 12:40:18,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. 141.27/119.31 [2019-03-28 12:40:18,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 141.27/119.31 [2019-03-28 12:40:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. 141.27/119.31 [2019-03-28 12:40:18,865 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. 141.27/119.31 [2019-03-28 12:40:18,865 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. 141.27/119.31 [2019-03-28 12:40:18,865 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 141.27/119.31 [2019-03-28 12:40:18,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. 141.27/119.31 [2019-03-28 12:40:18,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 141.27/119.31 [2019-03-28 12:40:18,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 141.27/119.31 [2019-03-28 12:40:18,867 INFO L119 BuchiIsEmpty]: Starting construction of run 141.27/119.31 [2019-03-28 12:40:18,867 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 141.27/119.31 [2019-03-28 12:40:18,867 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 141.27/119.31 [2019-03-28 12:40:18,868 INFO L794 eck$LassoCheckResult]: Stem: 108#ULTIMATE.startENTRY [85] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 105#L-1 [154] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 106#L10 [71] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 103#L10-1 [110] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 104#L11 [86] L11-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 98#L13-7 141.27/119.31 [2019-03-28 12:40:18,869 INFO L796 eck$LassoCheckResult]: Loop: 98#L13-7 [104] L13-7-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 100#L13 [175] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (>= 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 111#L13-1 [118] L13-1-->L13-5: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_5|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[] 101#L13-5 [108] L13-5-->L14: Formula: |v_ULTIMATE.start_test_fun_#t~short5_9| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 102#L14 [79] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{#valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 112#L14-1 [209] L14-1-->L15: Formula: (and (= (store |v_#memory_int_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_15 (store (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem6_6| (- 1)))) |v_#memory_int_21|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_31| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) InVars {#valid=|v_#valid_39|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_31|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{#valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_31|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem6] 95#L15 [82] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select |v_#valid_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) 1) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 96#L15-1 [212] L15-1-->L16: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select |v_#valid_44| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_34| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| (- 1)))) |v_#memory_int_25|)) InVars {#valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, #length=|v_#length_34|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_44|, #memory_int=|v_#memory_int_25|, #length=|v_#length_34|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 99#L16 [100] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_25| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 97#L16-1 [213] L16-1-->L13-7: Formula: (and (= (store |v_#memory_int_28| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_28| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| 1))) |v_#memory_int_27|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= 1 (select |v_#valid_45| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_28|, #length=|v_#length_35|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_27|, #length=|v_#length_35|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 98#L13-7 141.27/119.31 [2019-03-28 12:40:18,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.31 [2019-03-28 12:40:18,870 INFO L82 PathProgramCache]: Analyzing trace with hash 111787977, now seen corresponding path program 2 times 141.27/119.31 [2019-03-28 12:40:18,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 141.27/119.31 [2019-03-28 12:40:18,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 141.27/119.31 [2019-03-28 12:40:18,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:40:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:40:18,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.31 [2019-03-28 12:40:18,908 INFO L82 PathProgramCache]: Analyzing trace with hash -219762733, now seen corresponding path program 1 times 141.27/119.31 [2019-03-28 12:40:18,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 141.27/119.31 [2019-03-28 12:40:18,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 141.27/119.31 [2019-03-28 12:40:18,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.31 [2019-03-28 12:40:18,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 141.27/119.31 [2019-03-28 12:40:18,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 141.27/119.31 [2019-03-28 12:40:18,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 141.27/119.31 [2019-03-28 12:40:18,920 INFO L811 eck$LassoCheckResult]: loop already infeasible 141.27/119.31 [2019-03-28 12:40:18,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 141.27/119.31 [2019-03-28 12:40:18,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 141.27/119.31 [2019-03-28 12:40:18,921 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. 141.27/119.31 [2019-03-28 12:40:18,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 141.27/119.31 [2019-03-28 12:40:18,959 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. 141.27/119.31 [2019-03-28 12:40:18,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 141.27/119.31 [2019-03-28 12:40:18,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 27 transitions. 141.27/119.31 [2019-03-28 12:40:18,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 141.27/119.31 [2019-03-28 12:40:18,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 24 transitions. 141.27/119.31 [2019-03-28 12:40:18,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 141.27/119.31 [2019-03-28 12:40:18,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 141.27/119.31 [2019-03-28 12:40:18,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. 141.27/119.31 [2019-03-28 12:40:18,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 141.27/119.31 [2019-03-28 12:40:18,962 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. 141.27/119.31 [2019-03-28 12:40:18,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. 141.27/119.31 [2019-03-28 12:40:18,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 141.27/119.31 [2019-03-28 12:40:18,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 141.27/119.31 [2019-03-28 12:40:18,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. 141.27/119.31 [2019-03-28 12:40:18,964 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. 141.27/119.31 [2019-03-28 12:40:18,964 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. 141.27/119.31 [2019-03-28 12:40:18,964 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 141.27/119.31 [2019-03-28 12:40:18,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. 141.27/119.31 [2019-03-28 12:40:18,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 141.27/119.31 [2019-03-28 12:40:18,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 141.27/119.31 [2019-03-28 12:40:18,965 INFO L119 BuchiIsEmpty]: Starting construction of run 141.27/119.31 [2019-03-28 12:40:18,966 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 141.27/119.31 [2019-03-28 12:40:18,966 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 141.27/119.31 [2019-03-28 12:40:18,966 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY [85] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 148#L-1 [154] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 149#L10 [71] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 146#L10-1 [110] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 147#L11 [86] L11-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 141#L13-7 141.27/119.31 [2019-03-28 12:40:18,967 INFO L796 eck$LassoCheckResult]: Loop: 141#L13-7 [104] L13-7-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 143#L13 [176] L13-->L13-1: Formula: (and (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short5_2|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 153#L13-1 [117] L13-1-->L13-2: Formula: |v_ULTIMATE.start_test_fun_#t~short5_3| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} AuxVars[] AssignedVars[] 152#L13-2 [114] L13-2-->L13-3: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 150#L13-3 [181] L13-3-->L13-5: Formula: (and |v_ULTIMATE.start_test_fun_#t~short5_4| (< 0 |v_ULTIMATE.start_test_fun_#t~mem4_3|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 144#L13-5 [108] L13-5-->L14: Formula: |v_ULTIMATE.start_test_fun_#t~short5_9| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 145#L14 [79] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{#valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 154#L14-1 [209] L14-1-->L15: Formula: (and (= (store |v_#memory_int_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_15 (store (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem6_6| (- 1)))) |v_#memory_int_21|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_31| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) InVars {#valid=|v_#valid_39|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_31|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{#valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_31|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem6] 138#L15 [82] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select |v_#valid_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) 1) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 139#L15-1 [212] L15-1-->L16: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select |v_#valid_44| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_34| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| (- 1)))) |v_#memory_int_25|)) InVars {#valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, #length=|v_#length_34|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_44|, #memory_int=|v_#memory_int_25|, #length=|v_#length_34|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 142#L16 [100] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_25| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 140#L16-1 [213] L16-1-->L13-7: Formula: (and (= (store |v_#memory_int_28| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_28| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| 1))) |v_#memory_int_27|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= 1 (select |v_#valid_45| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_28|, #length=|v_#length_35|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_27|, #length=|v_#length_35|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 141#L13-7 141.27/119.31 [2019-03-28 12:40:18,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.31 [2019-03-28 12:40:18,968 INFO L82 PathProgramCache]: Analyzing trace with hash 111787977, now seen corresponding path program 3 times 141.27/119.31 [2019-03-28 12:40:18,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 141.27/119.31 [2019-03-28 12:40:18,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 141.27/119.31 [2019-03-28 12:40:18,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:40:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:40:18,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.31 [2019-03-28 12:40:18,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1841392914, now seen corresponding path program 1 times 141.27/119.31 [2019-03-28 12:40:18,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 141.27/119.31 [2019-03-28 12:40:18,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 141.27/119.31 [2019-03-28 12:40:18,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:18,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:40:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:40:19,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.31 [2019-03-28 12:40:19,011 INFO L82 PathProgramCache]: Analyzing trace with hash -685653798, now seen corresponding path program 1 times 141.27/119.31 [2019-03-28 12:40:19,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 141.27/119.31 [2019-03-28 12:40:19,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 141.27/119.31 [2019-03-28 12:40:19,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:19,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:19,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:40:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:40:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:40:19,583 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 90 141.27/119.31 [2019-03-28 12:40:19,767 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 84 141.27/119.31 [2019-03-28 12:40:19,781 INFO L216 LassoAnalysis]: Preferences: 141.27/119.31 [2019-03-28 12:40:19,782 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 141.27/119.31 [2019-03-28 12:40:19,782 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 141.27/119.31 [2019-03-28 12:40:19,782 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 141.27/119.31 [2019-03-28 12:40:19,783 INFO L127 ssoRankerPreferences]: Use exernal solver: false 141.27/119.31 [2019-03-28 12:40:19,783 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 141.27/119.31 [2019-03-28 12:40:19,783 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 141.27/119.31 [2019-03-28 12:40:19,783 INFO L130 ssoRankerPreferences]: Path of dumped script: 141.27/119.31 [2019-03-28 12:40:19,783 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 141.27/119.31 [2019-03-28 12:40:19,783 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 141.27/119.31 [2019-03-28 12:40:19,784 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 141.27/119.31 [2019-03-28 12:40:19,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:40:19,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:40:19,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:40:19,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:40:19,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:40:19,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:40:19,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:40:19,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:40:19,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:40:19,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:40:19,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:40:20,166 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 141.27/119.31 [2019-03-28 12:40:20,288 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 141.27/119.31 [2019-03-28 12:40:20,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:40:20,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:40:20,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:40:20,714 INFO L300 LassoAnalysis]: Preprocessing complete. 141.27/119.31 [2019-03-28 12:40:20,719 INFO L497 LassoAnalysis]: Using template 'affine'. 141.27/119.31 [2019-03-28 12:40:20,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:40:20,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:40:20,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 141.27/119.31 [2019-03-28 12:40:20,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:40:20,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:40:20,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:40:20,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:40:20,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 141.27/119.31 [2019-03-28 12:40:20,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:40:20,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:40:20,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:40:20,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:40:20,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:40:20,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:40:20,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:40:20,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 141.27/119.31 [2019-03-28 12:40:20,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:40:20,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:40:20,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:40:20,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 141.27/119.31 [2019-03-28 12:40:20,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:40:20,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:40:20,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:40:20,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:40:20,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 141.27/119.31 [2019-03-28 12:40:20,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:40:20,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:40:20,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:40:20,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:40:20,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:40:20,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:40:20,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:40:20,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 141.27/119.31 [2019-03-28 12:40:20,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:40:20,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:40:20,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:40:20,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 141.27/119.31 [2019-03-28 12:40:20,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:40:20,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:40:20,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:40:20,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:40:20,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 141.27/119.31 [2019-03-28 12:40:20,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:40:20,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:40:20,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:40:20,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:40:20,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:40:20,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:40:20,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:40:20,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 141.27/119.31 [2019-03-28 12:40:20,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:40:20,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:40:20,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:40:20,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 141.27/119.31 [2019-03-28 12:40:20,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:40:20,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:40:20,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:40:20,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:40:20,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 141.27/119.31 [2019-03-28 12:40:20,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:40:20,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:40:20,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:40:20,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 141.27/119.31 [2019-03-28 12:40:20,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:40:20,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:40:20,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:40:20,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:40:20,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 141.27/119.31 [2019-03-28 12:40:20,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:40:20,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:40:20,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:40:20,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 141.27/119.31 [2019-03-28 12:40:20,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:40:20,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:40:20,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:40:20,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:40:20,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 141.27/119.31 [2019-03-28 12:40:20,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:40:20,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:40:20,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:40:20,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 141.27/119.31 [2019-03-28 12:40:20,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:40:20,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:40:20,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:40:20,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:40:20,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 141.27/119.31 [2019-03-28 12:40:20,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:40:20,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:40:20,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:40:20,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:40:20,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:40:20,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:40:20,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:40:20,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 141.27/119.31 [2019-03-28 12:40:20,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:40:20,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:40:20,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:40:20,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:40:20,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:40:20,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:40:20,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:40:20,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 141.27/119.31 [2019-03-28 12:40:20,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:40:20,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:40:20,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:40:20,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:40:20,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:40:20,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:40:20,816 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:40:20,816 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 141.27/119.31 [2019-03-28 12:40:20,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:40:20,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:40:20,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:40:20,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:40:20,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:40:20,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:40:20,827 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:40:20,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 141.27/119.31 [2019-03-28 12:40:20,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:40:20,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:40:20,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:40:20,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:40:20,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:40:20,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:40:20,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:40:20,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 141.27/119.31 [2019-03-28 12:40:20,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:40:20,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:40:20,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:40:20,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:40:20,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:40:20,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:40:20,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:40:20,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 141.27/119.31 [2019-03-28 12:40:20,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:40:20,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:40:20,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:40:20,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:40:20,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:40:20,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:40:20,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:40:20,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 141.27/119.31 [2019-03-28 12:40:20,861 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 141.27/119.31 [2019-03-28 12:40:20,868 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 141.27/119.31 [2019-03-28 12:40:20,868 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. 141.27/119.31 [2019-03-28 12:40:20,871 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 141.27/119.31 [2019-03-28 12:40:20,873 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 141.27/119.31 [2019-03-28 12:40:20,873 INFO L518 LassoAnalysis]: Proved termination. 141.27/119.31 [2019-03-28 12:40:20,874 INFO L520 LassoAnalysis]: Termination argument consisting of: 141.27/119.31 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 141.27/119.31 Supporting invariants [] 141.27/119.31 [2019-03-28 12:40:20,983 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 141.27/119.31 [2019-03-28 12:40:20,987 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 141.27/119.31 [2019-03-28 12:40:21,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.31 [2019-03-28 12:40:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.31 [2019-03-28 12:40:21,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core 141.27/119.31 [2019-03-28 12:40:21,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... 141.27/119.31 [2019-03-28 12:40:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.31 [2019-03-28 12:40:21,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core 141.27/119.31 [2019-03-28 12:40:21,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... 141.27/119.31 [2019-03-28 12:40:21,202 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 141.27/119.31 [2019-03-28 12:40:21,203 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:21,213 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:40:21,214 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:21,214 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 141.27/119.31 [2019-03-28 12:40:21,293 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:40:21,294 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 63 141.27/119.31 [2019-03-28 12:40:21,303 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:21,353 INFO L497 ElimStorePlain]: treesize reduction 35, result has 57.8 percent of original size 141.27/119.31 [2019-03-28 12:40:21,355 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:21,355 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:36 141.27/119.31 [2019-03-28 12:40:27,016 WARN L188 SmtUtils]: Spent 2.84 s on a formula simplification that was a NOOP. DAG size: 26 141.27/119.31 [2019-03-28 12:40:27,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 141.27/119.31 [2019-03-28 12:40:28,576 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (not (and (= ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset) (= c_ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) 2) c_oldRank0)) is different from true 141.27/119.31 [2019-03-28 12:40:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.31 [2019-03-28 12:40:28,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core 141.27/119.31 [2019-03-28 12:40:28,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... 141.27/119.31 [2019-03-28 12:40:28,642 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 141.27/119.31 [2019-03-28 12:40:28,643 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:28,650 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:40:28,650 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:28,651 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 141.27/119.31 [2019-03-28 12:40:28,724 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:40:28,724 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 63 141.27/119.31 [2019-03-28 12:40:28,731 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:28,786 INFO L497 ElimStorePlain]: treesize reduction 35, result has 56.3 percent of original size 141.27/119.31 [2019-03-28 12:40:28,787 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:28,787 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:33 141.27/119.31 [2019-03-28 12:40:37,448 WARN L188 SmtUtils]: Spent 2.87 s on a formula simplification that was a NOOP. DAG size: 25 141.27/119.31 [2019-03-28 12:40:37,475 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 141.27/119.31 [2019-03-28 12:40:37,475 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:37,482 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:40:37,483 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:37,483 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 141.27/119.31 [2019-03-28 12:40:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:40:41,879 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 141.27/119.31 [2019-03-28 12:40:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.31 [2019-03-28 12:40:41,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 12 conjunts are in the unsatisfiable core 141.27/119.31 [2019-03-28 12:40:41,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... 141.27/119.31 [2019-03-28 12:40:41,968 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:40:41,969 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 61 141.27/119.31 [2019-03-28 12:40:41,974 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:42,035 INFO L497 ElimStorePlain]: treesize reduction 35, result has 53.9 percent of original size 141.27/119.31 [2019-03-28 12:40:42,036 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:42,036 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:38 141.27/119.31 [2019-03-28 12:40:42,120 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 141.27/119.31 [2019-03-28 12:40:42,120 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:42,131 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 141.27/119.31 [2019-03-28 12:40:42,131 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:42,140 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 141.27/119.31 [2019-03-28 12:40:42,141 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:42,172 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:40:42,173 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 141.27/119.31 [2019-03-28 12:40:42,173 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:92, output treesize:53 141.27/119.31 [2019-03-28 12:40:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:40:42,995 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 141.27/119.31 [2019-03-28 12:40:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.31 [2019-03-28 12:40:43,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core 141.27/119.31 [2019-03-28 12:40:43,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... 141.27/119.31 [2019-03-28 12:40:43,013 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 141.27/119.31 [2019-03-28 12:40:43,013 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:43,020 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:40:43,021 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:43,021 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 141.27/119.31 [2019-03-28 12:40:43,033 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 141.27/119.31 [2019-03-28 12:40:43,034 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:43,041 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:40:43,042 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:43,042 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 141.27/119.31 [2019-03-28 12:40:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.31 [2019-03-28 12:40:43,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core 141.27/119.31 [2019-03-28 12:40:43,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... 141.27/119.31 [2019-03-28 12:40:43,060 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 141.27/119.31 [2019-03-28 12:40:43,061 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:43,067 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:40:43,068 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:43,068 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 141.27/119.31 [2019-03-28 12:40:43,080 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 141.27/119.31 [2019-03-28 12:40:43,081 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:43,088 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:40:43,088 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:43,088 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 141.27/119.31 [2019-03-28 12:40:43,112 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:40:43,113 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 63 141.27/119.31 [2019-03-28 12:40:43,118 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:43,225 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 141.27/119.31 [2019-03-28 12:40:43,226 INFO L497 ElimStorePlain]: treesize reduction 35, result has 57.8 percent of original size 141.27/119.31 [2019-03-28 12:40:43,227 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 141.27/119.31 [2019-03-28 12:40:43,228 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:36 141.27/119.31 [2019-03-28 12:40:43,247 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 17 predicates after loop cannibalization 141.27/119.31 [2019-03-28 12:40:43,251 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 17 loop predicates 141.27/119.31 [2019-03-28 12:40:43,252 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 24 transitions. cyclomatic complexity: 8 Second operand 9 states. 141.27/119.31 [2019-03-28 12:41:06,992 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 141.27/119.31 [2019-03-28 12:41:07,267 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 141.27/119.31 [2019-03-28 12:41:07,586 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 24 transitions. cyclomatic complexity: 8. Second operand 9 states. Result 154 states and 161 transitions. Complement of second has 76 states. 141.27/119.31 [2019-03-28 12:41:07,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 26 states 4 stem states 20 non-accepting loop states 2 accepting loop states 141.27/119.31 [2019-03-28 12:41:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 141.27/119.31 [2019-03-28 12:41:07,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 104 transitions. 141.27/119.31 [2019-03-28 12:41:07,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 104 transitions. Stem has 5 letters. Loop has 12 letters. 141.27/119.31 [2019-03-28 12:41:07,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. 141.27/119.31 [2019-03-28 12:41:07,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 104 transitions. Stem has 17 letters. Loop has 12 letters. 141.27/119.31 [2019-03-28 12:41:07,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. 141.27/119.31 [2019-03-28 12:41:07,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 104 transitions. Stem has 5 letters. Loop has 24 letters. 141.27/119.31 [2019-03-28 12:41:07,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. 141.27/119.31 [2019-03-28 12:41:07,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 161 transitions. 141.27/119.31 [2019-03-28 12:41:07,604 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 141.27/119.31 [2019-03-28 12:41:07,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 83 states and 88 transitions. 141.27/119.31 [2019-03-28 12:41:07,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 141.27/119.31 [2019-03-28 12:41:07,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 141.27/119.31 [2019-03-28 12:41:07,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 88 transitions. 141.27/119.31 [2019-03-28 12:41:07,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 141.27/119.31 [2019-03-28 12:41:07,607 INFO L706 BuchiCegarLoop]: Abstraction has 83 states and 88 transitions. 141.27/119.31 [2019-03-28 12:41:07,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 88 transitions. 141.27/119.31 [2019-03-28 12:41:07,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 17. 141.27/119.31 [2019-03-28 12:41:07,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 141.27/119.31 [2019-03-28 12:41:07,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. 141.27/119.31 [2019-03-28 12:41:07,609 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. 141.27/119.31 [2019-03-28 12:41:07,609 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. 141.27/119.31 [2019-03-28 12:41:07,609 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 141.27/119.31 [2019-03-28 12:41:07,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. 141.27/119.31 [2019-03-28 12:41:07,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 141.27/119.31 [2019-03-28 12:41:07,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 141.27/119.31 [2019-03-28 12:41:07,610 INFO L119 BuchiIsEmpty]: Starting construction of run 141.27/119.31 [2019-03-28 12:41:07,611 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 141.27/119.31 [2019-03-28 12:41:07,611 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 141.27/119.31 [2019-03-28 12:41:07,611 INFO L794 eck$LassoCheckResult]: Stem: 776#ULTIMATE.startENTRY [85] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 773#L-1 [153] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 774#L10 [71] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 771#L10-1 [110] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 772#L11 [86] L11-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 766#L13-7 141.27/119.31 [2019-03-28 12:41:07,612 INFO L796 eck$LassoCheckResult]: Loop: 766#L13-7 [104] L13-7-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 768#L13 [176] L13-->L13-1: Formula: (and (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short5_2|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 778#L13-1 [117] L13-1-->L13-2: Formula: |v_ULTIMATE.start_test_fun_#t~short5_3| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} AuxVars[] AssignedVars[] 777#L13-2 [114] L13-2-->L13-3: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 775#L13-3 [181] L13-3-->L13-5: Formula: (and |v_ULTIMATE.start_test_fun_#t~short5_4| (< 0 |v_ULTIMATE.start_test_fun_#t~mem4_3|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 769#L13-5 [108] L13-5-->L14: Formula: |v_ULTIMATE.start_test_fun_#t~short5_9| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 770#L14 [79] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{#valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 779#L14-1 [209] L14-1-->L15: Formula: (and (= (store |v_#memory_int_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_15 (store (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem6_6| (- 1)))) |v_#memory_int_21|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_31| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) InVars {#valid=|v_#valid_39|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_31|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{#valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_31|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem6] 763#L15 [82] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select |v_#valid_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) 1) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 764#L15-1 [212] L15-1-->L16: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select |v_#valid_44| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_34| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| (- 1)))) |v_#memory_int_25|)) InVars {#valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, #length=|v_#length_34|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_44|, #memory_int=|v_#memory_int_25|, #length=|v_#length_34|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 767#L16 [100] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_25| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 765#L16-1 [213] L16-1-->L13-7: Formula: (and (= (store |v_#memory_int_28| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_28| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| 1))) |v_#memory_int_27|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= 1 (select |v_#valid_45| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_28|, #length=|v_#length_35|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_27|, #length=|v_#length_35|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 766#L13-7 141.27/119.31 [2019-03-28 12:41:07,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.31 [2019-03-28 12:41:07,612 INFO L82 PathProgramCache]: Analyzing trace with hash 111758186, now seen corresponding path program 1 times 141.27/119.31 [2019-03-28 12:41:07,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 141.27/119.31 [2019-03-28 12:41:07,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 141.27/119.31 [2019-03-28 12:41:07,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:41:07,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:41:07,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:41:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:41:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:41:07,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.31 [2019-03-28 12:41:07,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1841392914, now seen corresponding path program 2 times 141.27/119.31 [2019-03-28 12:41:07,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 141.27/119.31 [2019-03-28 12:41:07,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 141.27/119.31 [2019-03-28 12:41:07,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:41:07,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:41:07,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:41:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:41:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:41:07,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.31 [2019-03-28 12:41:07,646 INFO L82 PathProgramCache]: Analyzing trace with hash -175119621, now seen corresponding path program 1 times 141.27/119.31 [2019-03-28 12:41:07,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 141.27/119.31 [2019-03-28 12:41:07,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 141.27/119.31 [2019-03-28 12:41:07,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:41:07,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:41:07,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:41:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:41:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:41:08,161 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 141.27/119.31 [2019-03-28 12:41:08,310 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 78 141.27/119.31 [2019-03-28 12:41:08,315 INFO L216 LassoAnalysis]: Preferences: 141.27/119.31 [2019-03-28 12:41:08,315 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 141.27/119.31 [2019-03-28 12:41:08,315 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 141.27/119.31 [2019-03-28 12:41:08,315 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 141.27/119.31 [2019-03-28 12:41:08,316 INFO L127 ssoRankerPreferences]: Use exernal solver: false 141.27/119.31 [2019-03-28 12:41:08,316 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 141.27/119.31 [2019-03-28 12:41:08,316 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 141.27/119.31 [2019-03-28 12:41:08,316 INFO L130 ssoRankerPreferences]: Path of dumped script: 141.27/119.31 [2019-03-28 12:41:08,316 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 141.27/119.31 [2019-03-28 12:41:08,316 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 141.27/119.31 [2019-03-28 12:41:08,316 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 141.27/119.31 [2019-03-28 12:41:08,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:08,623 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 141.27/119.31 [2019-03-28 12:41:08,734 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 141.27/119.31 [2019-03-28 12:41:08,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:08,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:08,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:08,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:08,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:08,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:08,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:08,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:08,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:08,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:08,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:08,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:09,163 INFO L300 LassoAnalysis]: Preprocessing complete. 141.27/119.31 [2019-03-28 12:41:09,163 INFO L497 LassoAnalysis]: Using template 'affine'. 141.27/119.31 [2019-03-28 12:41:09,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:41:09,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:41:09,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:41:09,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:41:09,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:41:09,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:41:09,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 141.27/119.31 [2019-03-28 12:41:09,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:41:09,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:41:09,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:41:09,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:41:09,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:41:09,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:41:09,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:41:09,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 141.27/119.31 [2019-03-28 12:41:09,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:41:09,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:41:09,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:41:09,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:41:09,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:41:09,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:41:09,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:41:09,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 141.27/119.31 [2019-03-28 12:41:09,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:41:09,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:41:09,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:41:09,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:41:09,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:41:09,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:41:09,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:41:09,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 141.27/119.31 [2019-03-28 12:41:09,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:41:09,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:41:09,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:41:09,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:41:09,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:41:09,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:41:09,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:41:09,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 141.27/119.31 [2019-03-28 12:41:09,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:41:09,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:41:09,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:41:09,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:41:09,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:41:09,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:41:09,210 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:41:09,210 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 141.27/119.31 [2019-03-28 12:41:09,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:41:09,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:41:09,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:41:09,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:41:09,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:41:09,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:41:09,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:41:09,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 141.27/119.31 [2019-03-28 12:41:09,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:41:09,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:41:09,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:41:09,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:41:09,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:41:09,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:41:09,222 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:41:09,222 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 141.27/119.31 [2019-03-28 12:41:09,231 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 141.27/119.31 [2019-03-28 12:41:09,237 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 141.27/119.31 [2019-03-28 12:41:09,238 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. 141.27/119.31 [2019-03-28 12:41:09,238 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 141.27/119.31 [2019-03-28 12:41:09,239 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 141.27/119.31 [2019-03-28 12:41:09,239 INFO L518 LassoAnalysis]: Proved termination. 141.27/119.31 [2019-03-28 12:41:09,239 INFO L520 LassoAnalysis]: Termination argument consisting of: 141.27/119.31 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 141.27/119.31 Supporting invariants [] 141.27/119.31 [2019-03-28 12:41:09,317 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 141.27/119.31 [2019-03-28 12:41:09,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 141.27/119.31 [2019-03-28 12:41:09,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.31 [2019-03-28 12:41:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.31 [2019-03-28 12:41:09,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core 141.27/119.31 [2019-03-28 12:41:09,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... 141.27/119.31 [2019-03-28 12:41:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.31 [2019-03-28 12:41:09,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core 141.27/119.31 [2019-03-28 12:41:09,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... 141.27/119.31 [2019-03-28 12:41:09,488 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:41:09,489 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 64 141.27/119.31 [2019-03-28 12:41:09,495 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:09,571 INFO L497 ElimStorePlain]: treesize reduction 51, result has 50.5 percent of original size 141.27/119.31 [2019-03-28 12:41:09,573 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:09,573 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:42 141.27/119.31 [2019-03-28 12:41:14,041 WARN L188 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 26 141.27/119.31 [2019-03-28 12:41:15,549 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 141.27/119.31 [2019-03-28 12:41:15,550 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:15,562 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 141.27/119.31 [2019-03-28 12:41:15,563 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:15,586 INFO L497 ElimStorePlain]: treesize reduction 23, result has 46.5 percent of original size 141.27/119.31 [2019-03-28 12:41:15,587 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:15,587 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:17 141.27/119.31 [2019-03-28 12:41:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 141.27/119.31 [2019-03-28 12:41:17,116 WARN L860 $PredicateComparison]: unable to prove that (or (<= 1 c_oldRank0) (exists ((ULTIMATE.start_test_fun_~x_ref~0.base Int) (ULTIMATE.start_test_fun_~x_ref~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~y_ref~0.base))))) is different from true 141.27/119.31 [2019-03-28 12:41:18,629 WARN L860 $PredicateComparison]: unable to prove that (or (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 1) c_oldRank0) (exists ((ULTIMATE.start_test_fun_~x_ref~0.base Int) (ULTIMATE.start_test_fun_~x_ref~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~y_ref~0.base))))) is different from true 141.27/119.31 [2019-03-28 12:41:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:41:18,714 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 141.27/119.31 [2019-03-28 12:41:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:41:18,725 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 141.27/119.31 [2019-03-28 12:41:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.31 [2019-03-28 12:41:18,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core 141.27/119.31 [2019-03-28 12:41:18,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... 141.27/119.31 [2019-03-28 12:41:18,767 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 141.27/119.31 [2019-03-28 12:41:18,768 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:18,774 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:41:18,774 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:18,774 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 141.27/119.31 [2019-03-28 12:41:18,804 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 141.27/119.31 [2019-03-28 12:41:18,804 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:18,812 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:41:18,812 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:18,812 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 141.27/119.31 [2019-03-28 12:41:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:41:18,912 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 141.27/119.31 [2019-03-28 12:41:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.31 [2019-03-28 12:41:18,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core 141.27/119.31 [2019-03-28 12:41:18,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... 141.27/119.31 [2019-03-28 12:41:18,928 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 141.27/119.31 [2019-03-28 12:41:18,928 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:18,934 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:41:18,935 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:18,935 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 141.27/119.31 [2019-03-28 12:41:18,964 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:41:18,965 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 64 141.27/119.31 [2019-03-28 12:41:18,969 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:19,026 INFO L497 ElimStorePlain]: treesize reduction 39, result has 57.1 percent of original size 141.27/119.31 [2019-03-28 12:41:19,028 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:19,028 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:42 141.27/119.31 [2019-03-28 12:41:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.31 [2019-03-28 12:41:19,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core 141.27/119.31 [2019-03-28 12:41:19,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... 141.27/119.31 [2019-03-28 12:41:19,065 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 141.27/119.31 [2019-03-28 12:41:19,066 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:19,072 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:41:19,073 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:19,073 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 141.27/119.31 [2019-03-28 12:41:19,112 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:41:19,112 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 64 141.27/119.31 [2019-03-28 12:41:19,117 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:19,188 INFO L497 ElimStorePlain]: treesize reduction 51, result has 50.5 percent of original size 141.27/119.31 [2019-03-28 12:41:19,190 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:19,190 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:42 141.27/119.31 [2019-03-28 12:41:19,219 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 141.27/119.31 [2019-03-28 12:41:19,220 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:19,225 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 141.27/119.31 [2019-03-28 12:41:19,226 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:19,247 INFO L497 ElimStorePlain]: treesize reduction 23, result has 46.5 percent of original size 141.27/119.31 [2019-03-28 12:41:19,247 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:19,247 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:17 141.27/119.31 [2019-03-28 12:41:19,274 INFO L98 LoopCannibalizer]: 13 predicates before loop cannibalization 13 predicates after loop cannibalization 141.27/119.31 [2019-03-28 12:41:19,275 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 13 loop predicates 141.27/119.31 [2019-03-28 12:41:19,275 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 22 transitions. cyclomatic complexity: 6 Second operand 10 states. 141.27/119.31 [2019-03-28 12:41:24,348 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 22 transitions. cyclomatic complexity: 6. Second operand 10 states. Result 141 states and 147 transitions. Complement of second has 64 states. 141.27/119.31 [2019-03-28 12:41:24,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 4 stem states 14 non-accepting loop states 2 accepting loop states 141.27/119.31 [2019-03-28 12:41:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 141.27/119.31 [2019-03-28 12:41:24,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 95 transitions. 141.27/119.31 [2019-03-28 12:41:24,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 95 transitions. Stem has 5 letters. Loop has 12 letters. 141.27/119.31 [2019-03-28 12:41:24,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. 141.27/119.31 [2019-03-28 12:41:24,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 95 transitions. Stem has 17 letters. Loop has 12 letters. 141.27/119.31 [2019-03-28 12:41:24,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. 141.27/119.31 [2019-03-28 12:41:24,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 95 transitions. Stem has 5 letters. Loop has 24 letters. 141.27/119.31 [2019-03-28 12:41:24,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. 141.27/119.31 [2019-03-28 12:41:24,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 147 transitions. 141.27/119.31 [2019-03-28 12:41:24,363 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 141.27/119.31 [2019-03-28 12:41:24,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 83 states and 86 transitions. 141.27/119.31 [2019-03-28 12:41:24,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 141.27/119.31 [2019-03-28 12:41:24,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 141.27/119.31 [2019-03-28 12:41:24,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 86 transitions. 141.27/119.31 [2019-03-28 12:41:24,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 141.27/119.31 [2019-03-28 12:41:24,365 INFO L706 BuchiCegarLoop]: Abstraction has 83 states and 86 transitions. 141.27/119.31 [2019-03-28 12:41:24,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 86 transitions. 141.27/119.31 [2019-03-28 12:41:24,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 17. 141.27/119.31 [2019-03-28 12:41:24,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 141.27/119.31 [2019-03-28 12:41:24,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. 141.27/119.31 [2019-03-28 12:41:24,367 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. 141.27/119.31 [2019-03-28 12:41:24,367 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. 141.27/119.31 [2019-03-28 12:41:24,368 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 141.27/119.31 [2019-03-28 12:41:24,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. 141.27/119.31 [2019-03-28 12:41:24,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 141.27/119.31 [2019-03-28 12:41:24,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 141.27/119.31 [2019-03-28 12:41:24,368 INFO L119 BuchiIsEmpty]: Starting construction of run 141.27/119.31 [2019-03-28 12:41:24,369 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 141.27/119.31 [2019-03-28 12:41:24,369 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 141.27/119.31 [2019-03-28 12:41:24,370 INFO L794 eck$LassoCheckResult]: Stem: 1319#ULTIMATE.startENTRY [85] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1316#L-1 [152] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 1317#L10 [71] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 1314#L10-1 [110] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 1315#L11 [86] L11-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 1309#L13-7 141.27/119.31 [2019-03-28 12:41:24,370 INFO L796 eck$LassoCheckResult]: Loop: 1309#L13-7 [104] L13-7-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 1311#L13 [176] L13-->L13-1: Formula: (and (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short5_2|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 1321#L13-1 [117] L13-1-->L13-2: Formula: |v_ULTIMATE.start_test_fun_#t~short5_3| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} AuxVars[] AssignedVars[] 1320#L13-2 [114] L13-2-->L13-3: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 1318#L13-3 [181] L13-3-->L13-5: Formula: (and |v_ULTIMATE.start_test_fun_#t~short5_4| (< 0 |v_ULTIMATE.start_test_fun_#t~mem4_3|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 1312#L13-5 [108] L13-5-->L14: Formula: |v_ULTIMATE.start_test_fun_#t~short5_9| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 1313#L14 [79] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{#valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 1322#L14-1 [209] L14-1-->L15: Formula: (and (= (store |v_#memory_int_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_15 (store (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem6_6| (- 1)))) |v_#memory_int_21|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_31| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) InVars {#valid=|v_#valid_39|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_31|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{#valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_31|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem6] 1306#L15 [82] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select |v_#valid_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) 1) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 1307#L15-1 [212] L15-1-->L16: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select |v_#valid_44| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_34| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| (- 1)))) |v_#memory_int_25|)) InVars {#valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, #length=|v_#length_34|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_44|, #memory_int=|v_#memory_int_25|, #length=|v_#length_34|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 1310#L16 [100] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_25| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1308#L16-1 [213] L16-1-->L13-7: Formula: (and (= (store |v_#memory_int_28| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_28| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| 1))) |v_#memory_int_27|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= 1 (select |v_#valid_45| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_28|, #length=|v_#length_35|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_27|, #length=|v_#length_35|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 1309#L13-7 141.27/119.31 [2019-03-28 12:41:24,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.31 [2019-03-28 12:41:24,371 INFO L82 PathProgramCache]: Analyzing trace with hash 111728395, now seen corresponding path program 1 times 141.27/119.31 [2019-03-28 12:41:24,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 141.27/119.31 [2019-03-28 12:41:24,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 141.27/119.31 [2019-03-28 12:41:24,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:41:24,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:41:24,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:41:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:41:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:41:24,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.31 [2019-03-28 12:41:24,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1841392914, now seen corresponding path program 3 times 141.27/119.31 [2019-03-28 12:41:24,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 141.27/119.31 [2019-03-28 12:41:24,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 141.27/119.31 [2019-03-28 12:41:24,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:41:24,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:41:24,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:41:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:41:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:41:24,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.31 [2019-03-28 12:41:24,402 INFO L82 PathProgramCache]: Analyzing trace with hash 335414556, now seen corresponding path program 1 times 141.27/119.31 [2019-03-28 12:41:24,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 141.27/119.31 [2019-03-28 12:41:24,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 141.27/119.31 [2019-03-28 12:41:24,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:41:24,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:41:24,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 141.27/119.31 [2019-03-28 12:41:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:41:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:41:24,862 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 86 141.27/119.31 [2019-03-28 12:41:24,999 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 80 141.27/119.31 [2019-03-28 12:41:25,003 INFO L216 LassoAnalysis]: Preferences: 141.27/119.31 [2019-03-28 12:41:25,003 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 141.27/119.31 [2019-03-28 12:41:25,003 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 141.27/119.31 [2019-03-28 12:41:25,003 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 141.27/119.31 [2019-03-28 12:41:25,003 INFO L127 ssoRankerPreferences]: Use exernal solver: false 141.27/119.31 [2019-03-28 12:41:25,003 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 141.27/119.31 [2019-03-28 12:41:25,003 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 141.27/119.31 [2019-03-28 12:41:25,004 INFO L130 ssoRankerPreferences]: Path of dumped script: 141.27/119.31 [2019-03-28 12:41:25,004 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 141.27/119.31 [2019-03-28 12:41:25,004 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 141.27/119.31 [2019-03-28 12:41:25,004 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 141.27/119.31 [2019-03-28 12:41:25,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:25,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:25,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:25,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:25,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:25,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:25,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:25,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:25,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:25,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:25,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:25,306 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 141.27/119.31 [2019-03-28 12:41:25,415 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 141.27/119.31 [2019-03-28 12:41:25,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:25,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 141.27/119.31 [2019-03-28 12:41:25,807 INFO L300 LassoAnalysis]: Preprocessing complete. 141.27/119.31 [2019-03-28 12:41:25,808 INFO L497 LassoAnalysis]: Using template 'affine'. 141.27/119.31 [2019-03-28 12:41:25,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:41:25,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:41:25,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:41:25,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:41:25,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:41:25,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:41:25,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 141.27/119.31 [2019-03-28 12:41:25,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:41:25,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:41:25,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:41:25,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 141.27/119.31 [2019-03-28 12:41:25,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:41:25,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:41:25,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:41:25,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:41:25,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 141.27/119.31 [2019-03-28 12:41:25,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:41:25,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:41:25,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:41:25,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 141.27/119.31 [2019-03-28 12:41:25,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:41:25,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:41:25,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:41:25,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:41:25,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 141.27/119.31 [2019-03-28 12:41:25,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:41:25,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:41:25,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:41:25,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 141.27/119.31 [2019-03-28 12:41:25,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:41:25,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:41:25,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:41:25,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:41:25,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 141.27/119.31 [2019-03-28 12:41:25,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:41:25,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:41:25,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:41:25,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 141.27/119.31 [2019-03-28 12:41:25,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:41:25,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:41:25,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:41:25,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:41:25,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 141.27/119.31 [2019-03-28 12:41:25,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:41:25,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:41:25,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:41:25,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 141.27/119.31 [2019-03-28 12:41:25,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:41:25,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:41:25,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:41:25,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:41:25,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 141.27/119.31 [2019-03-28 12:41:25,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:41:25,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:41:25,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:41:25,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 141.27/119.31 [2019-03-28 12:41:25,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:41:25,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:41:25,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:41:25,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:41:25,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 141.27/119.31 [2019-03-28 12:41:25,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:41:25,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:41:25,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:41:25,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 141.27/119.31 [2019-03-28 12:41:25,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:41:25,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:41:25,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:41:25,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:41:25,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 141.27/119.31 [2019-03-28 12:41:25,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:41:25,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:41:25,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:41:25,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:41:25,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:41:25,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:41:25,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:41:25,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 141.27/119.31 [2019-03-28 12:41:25,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:41:25,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:41:25,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:41:25,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 141.27/119.31 [2019-03-28 12:41:25,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:41:25,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:41:25,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:41:25,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:41:25,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 141.27/119.31 [2019-03-28 12:41:25,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 141.27/119.31 [2019-03-28 12:41:25,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 141.27/119.31 Termination analysis: LINEAR_WITH_GUESSES 141.27/119.31 Number of strict supporting invariants: 0 141.27/119.31 Number of non-strict supporting invariants: 1 141.27/119.31 Consider only non-deceasing supporting invariants: true 141.27/119.31 Simplify termination arguments: true 141.27/119.31 Simplify supporting invariants: trueOverapproximate stem: false 141.27/119.31 [2019-03-28 12:41:25,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. 141.27/119.31 [2019-03-28 12:41:25,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 141.27/119.31 [2019-03-28 12:41:25,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 141.27/119.31 [2019-03-28 12:41:25,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 141.27/119.31 [2019-03-28 12:41:25,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 141.27/119.31 [2019-03-28 12:41:25,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 141.27/119.31 [2019-03-28 12:41:25,840 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 141.27/119.31 [2019-03-28 12:41:25,847 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 141.27/119.31 [2019-03-28 12:41:25,848 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. 141.27/119.31 [2019-03-28 12:41:25,848 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 141.27/119.31 [2019-03-28 12:41:25,849 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 141.27/119.31 [2019-03-28 12:41:25,849 INFO L518 LassoAnalysis]: Proved termination. 141.27/119.31 [2019-03-28 12:41:25,850 INFO L520 LassoAnalysis]: Termination argument consisting of: 141.27/119.31 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 141.27/119.31 Supporting invariants [] 141.27/119.31 [2019-03-28 12:41:25,928 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 141.27/119.31 [2019-03-28 12:41:25,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 141.27/119.31 [2019-03-28 12:41:25,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 141.27/119.31 [2019-03-28 12:41:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.31 [2019-03-28 12:41:25,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core 141.27/119.31 [2019-03-28 12:41:25,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... 141.27/119.31 [2019-03-28 12:41:25,969 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 141.27/119.31 [2019-03-28 12:41:25,969 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:25,973 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:41:25,974 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:25,974 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 141.27/119.31 [2019-03-28 12:41:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.31 [2019-03-28 12:41:25,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core 141.27/119.31 [2019-03-28 12:41:25,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... 141.27/119.31 [2019-03-28 12:41:26,032 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 141.27/119.31 [2019-03-28 12:41:26,032 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:26,039 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:41:26,040 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:26,040 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 141.27/119.31 [2019-03-28 12:41:26,095 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:41:26,096 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 63 141.27/119.31 [2019-03-28 12:41:26,100 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:26,146 INFO L497 ElimStorePlain]: treesize reduction 35, result has 57.8 percent of original size 141.27/119.31 [2019-03-28 12:41:26,147 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:26,147 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:36 141.27/119.31 [2019-03-28 12:41:32,107 WARN L188 SmtUtils]: Spent 2.97 s on a formula simplification that was a NOOP. DAG size: 26 141.27/119.31 [2019-03-28 12:41:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 141.27/119.31 [2019-03-28 12:41:33,673 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (not (and (= ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset) (= c_ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) 2) c_oldRank0)) is different from true 141.27/119.31 [2019-03-28 12:41:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.31 [2019-03-28 12:41:33,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core 141.27/119.31 [2019-03-28 12:41:33,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... 141.27/119.31 [2019-03-28 12:41:33,731 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 141.27/119.31 [2019-03-28 12:41:33,732 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:33,738 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:41:33,738 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:33,738 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 141.27/119.31 [2019-03-28 12:41:33,804 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:41:33,804 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 63 141.27/119.31 [2019-03-28 12:41:33,808 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:33,855 INFO L497 ElimStorePlain]: treesize reduction 43, result has 51.1 percent of original size 141.27/119.31 [2019-03-28 12:41:33,856 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:33,856 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:33 141.27/119.31 [2019-03-28 12:41:42,639 WARN L188 SmtUtils]: Spent 2.91 s on a formula simplification that was a NOOP. DAG size: 25 141.27/119.31 [2019-03-28 12:41:42,661 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 141.27/119.31 [2019-03-28 12:41:42,661 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:42,667 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:41:42,668 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:42,668 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 141.27/119.31 [2019-03-28 12:41:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:41:47,189 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 141.27/119.31 [2019-03-28 12:41:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.31 [2019-03-28 12:41:47,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 12 conjunts are in the unsatisfiable core 141.27/119.31 [2019-03-28 12:41:47,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... 141.27/119.31 [2019-03-28 12:41:47,246 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:41:47,246 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 61 141.27/119.31 [2019-03-28 12:41:47,250 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:47,300 INFO L497 ElimStorePlain]: treesize reduction 35, result has 53.9 percent of original size 141.27/119.31 [2019-03-28 12:41:47,301 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:47,301 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:38 141.27/119.31 [2019-03-28 12:41:47,378 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 141.27/119.31 [2019-03-28 12:41:47,378 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:47,385 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 141.27/119.31 [2019-03-28 12:41:47,386 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:47,392 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 141.27/119.31 [2019-03-28 12:41:47,392 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:47,423 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:41:47,424 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 141.27/119.31 [2019-03-28 12:41:47,424 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:92, output treesize:53 141.27/119.31 [2019-03-28 12:41:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 141.27/119.31 [2019-03-28 12:41:48,207 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 141.27/119.31 [2019-03-28 12:41:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.31 [2019-03-28 12:41:48,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core 141.27/119.31 [2019-03-28 12:41:48,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... 141.27/119.31 [2019-03-28 12:41:48,223 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 141.27/119.31 [2019-03-28 12:41:48,223 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:48,229 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:41:48,230 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:48,230 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 141.27/119.31 [2019-03-28 12:41:48,240 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 141.27/119.31 [2019-03-28 12:41:48,241 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:48,248 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:41:48,248 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:48,248 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 141.27/119.31 [2019-03-28 12:41:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 141.27/119.31 [2019-03-28 12:41:48,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core 141.27/119.31 [2019-03-28 12:41:48,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... 141.27/119.31 [2019-03-28 12:41:48,264 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 141.27/119.31 [2019-03-28 12:41:48,265 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:48,271 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:41:48,271 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:48,271 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 141.27/119.31 [2019-03-28 12:41:48,281 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 141.27/119.31 [2019-03-28 12:41:48,281 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:48,288 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:41:48,288 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:48,289 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 141.27/119.31 [2019-03-28 12:41:48,311 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 141.27/119.31 [2019-03-28 12:41:48,311 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 63 141.27/119.31 [2019-03-28 12:41:48,315 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:48,364 INFO L497 ElimStorePlain]: treesize reduction 43, result has 52.7 percent of original size 141.27/119.31 [2019-03-28 12:41:48,365 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 141.27/119.31 [2019-03-28 12:41:48,365 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:36 141.27/119.31 [2019-03-28 12:41:48,379 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 17 predicates after loop cannibalization 141.27/119.31 [2019-03-28 12:41:48,380 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 17 loop predicates 141.27/119.31 [2019-03-28 12:41:48,380 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 20 transitions. cyclomatic complexity: 4 Second operand 9 states. 141.27/119.31 [2019-03-28 12:42:10,651 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 141.27/119.31 [2019-03-28 12:42:10,900 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 141.27/119.31 [2019-03-28 12:42:11,188 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 20 transitions. cyclomatic complexity: 4. Second operand 9 states. Result 43 states and 46 transitions. Complement of second has 29 states. 141.27/119.31 [2019-03-28 12:42:11,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 2 stem states 13 non-accepting loop states 1 accepting loop states 141.27/119.31 [2019-03-28 12:42:11,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 141.27/119.31 [2019-03-28 12:42:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 41 transitions. 141.27/119.31 [2019-03-28 12:42:11,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 41 transitions. Stem has 5 letters. Loop has 12 letters. 141.27/119.31 [2019-03-28 12:42:11,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. 141.27/119.31 [2019-03-28 12:42:11,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 41 transitions. Stem has 17 letters. Loop has 12 letters. 141.27/119.31 [2019-03-28 12:42:11,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. 141.27/119.31 [2019-03-28 12:42:11,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 41 transitions. Stem has 5 letters. Loop has 24 letters. 141.27/119.31 [2019-03-28 12:42:11,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. 141.27/119.31 [2019-03-28 12:42:11,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 46 transitions. 141.27/119.31 [2019-03-28 12:42:11,197 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 141.27/119.31 [2019-03-28 12:42:11,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 0 states and 0 transitions. 141.27/119.31 [2019-03-28 12:42:11,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 141.27/119.31 [2019-03-28 12:42:11,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 141.27/119.31 [2019-03-28 12:42:11,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 141.27/119.31 [2019-03-28 12:42:11,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 141.27/119.31 [2019-03-28 12:42:11,198 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 141.27/119.31 [2019-03-28 12:42:11,198 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 141.27/119.31 [2019-03-28 12:42:11,198 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 141.27/119.31 [2019-03-28 12:42:11,198 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 141.27/119.31 [2019-03-28 12:42:11,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 141.27/119.31 [2019-03-28 12:42:11,198 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 141.27/119.31 [2019-03-28 12:42:11,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 141.27/119.31 [2019-03-28 12:42:11,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:42:11 BasicIcfg 141.27/119.31 [2019-03-28 12:42:11,205 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 141.27/119.31 [2019-03-28 12:42:11,206 INFO L168 Benchmark]: Toolchain (without parser) took 115106.16 ms. Allocated memory was 649.6 MB in the beginning and 929.6 MB in the end (delta: 280.0 MB). Free memory was 563.3 MB in the beginning and 467.6 MB in the end (delta: 95.7 MB). Peak memory consumption was 375.7 MB. Max. memory is 50.3 GB. 141.27/119.31 [2019-03-28 12:42:11,206 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 141.27/119.31 [2019-03-28 12:42:11,207 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.87 ms. Allocated memory was 649.6 MB in the beginning and 662.2 MB in the end (delta: 12.6 MB). Free memory was 563.3 MB in the beginning and 627.6 MB in the end (delta: -64.3 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 141.27/119.31 [2019-03-28 12:42:11,207 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.27 ms. Allocated memory is still 662.2 MB. Free memory was 627.6 MB in the beginning and 623.7 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 141.27/119.31 [2019-03-28 12:42:11,208 INFO L168 Benchmark]: Boogie Preprocessor took 25.27 ms. Allocated memory is still 662.2 MB. Free memory was 623.7 MB in the beginning and 622.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 141.27/119.31 [2019-03-28 12:42:11,208 INFO L168 Benchmark]: RCFGBuilder took 365.77 ms. Allocated memory is still 662.2 MB. Free memory was 622.6 MB in the beginning and 598.3 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 50.3 GB. 141.27/119.31 [2019-03-28 12:42:11,208 INFO L168 Benchmark]: BlockEncodingV2 took 143.91 ms. Allocated memory is still 662.2 MB. Free memory was 597.2 MB in the beginning and 586.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 141.27/119.31 [2019-03-28 12:42:11,209 INFO L168 Benchmark]: TraceAbstraction took 1625.83 ms. Allocated memory is still 662.2 MB. Free memory was 586.4 MB in the beginning and 404.2 MB in the end (delta: 182.2 MB). Peak memory consumption was 182.2 MB. Max. memory is 50.3 GB. 141.27/119.31 [2019-03-28 12:42:11,210 INFO L168 Benchmark]: BuchiAutomizer took 112584.85 ms. Allocated memory was 662.2 MB in the beginning and 929.6 MB in the end (delta: 267.4 MB). Free memory was 403.1 MB in the beginning and 467.6 MB in the end (delta: -64.5 MB). Peak memory consumption was 202.9 MB. Max. memory is 50.3 GB. 141.27/119.31 [2019-03-28 12:42:11,213 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 141.27/119.31 --- Results --- 141.27/119.31 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 141.27/119.31 - StatisticsResult: Initial Icfg 141.27/119.31 50 locations, 52 edges 141.27/119.31 - StatisticsResult: Encoded RCFG 141.27/119.31 42 locations, 76 edges 141.27/119.31 * Results from de.uni_freiburg.informatik.ultimate.core: 141.27/119.31 - StatisticsResult: Toolchain Benchmarks 141.27/119.31 Benchmark results are: 141.27/119.31 * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 141.27/119.31 * CACSL2BoogieTranslator took 310.87 ms. Allocated memory was 649.6 MB in the beginning and 662.2 MB in the end (delta: 12.6 MB). Free memory was 563.3 MB in the beginning and 627.6 MB in the end (delta: -64.3 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 141.27/119.31 * Boogie Procedure Inliner took 44.27 ms. Allocated memory is still 662.2 MB. Free memory was 627.6 MB in the beginning and 623.7 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 141.27/119.31 * Boogie Preprocessor took 25.27 ms. Allocated memory is still 662.2 MB. Free memory was 623.7 MB in the beginning and 622.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 141.27/119.31 * RCFGBuilder took 365.77 ms. Allocated memory is still 662.2 MB. Free memory was 622.6 MB in the beginning and 598.3 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 50.3 GB. 141.27/119.31 * BlockEncodingV2 took 143.91 ms. Allocated memory is still 662.2 MB. Free memory was 597.2 MB in the beginning and 586.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 141.27/119.31 * TraceAbstraction took 1625.83 ms. Allocated memory is still 662.2 MB. Free memory was 586.4 MB in the beginning and 404.2 MB in the end (delta: 182.2 MB). Peak memory consumption was 182.2 MB. Max. memory is 50.3 GB. 141.27/119.31 * BuchiAutomizer took 112584.85 ms. Allocated memory was 662.2 MB in the beginning and 929.6 MB in the end (delta: 267.4 MB). Free memory was 403.1 MB in the beginning and 467.6 MB in the end (delta: -64.5 MB). Peak memory consumption was 202.9 MB. Max. memory is 50.3 GB. 141.27/119.31 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 141.27/119.31 - GenericResult: Unfinished Backtranslation 141.27/119.31 unknown boogie variable #length 141.27/119.31 - GenericResult: Unfinished Backtranslation 141.27/119.31 unknown boogie variable #length 141.27/119.31 - GenericResult: Unfinished Backtranslation 141.27/119.31 unknown boogie variable #length 141.27/119.31 - GenericResult: Unfinished Backtranslation 141.27/119.31 unknown boogie variable #length 141.27/119.31 - GenericResult: Unfinished Backtranslation 141.27/119.31 unknown boogie variable #length 141.27/119.31 - GenericResult: Unfinished Backtranslation 141.27/119.31 unknown boogie variable #length 141.27/119.31 - GenericResult: Unfinished Backtranslation 141.27/119.31 unknown boogie variable #memory_int 141.27/119.31 - GenericResult: Unfinished Backtranslation 141.27/119.31 unknown boogie variable #memory_int 141.27/119.31 - GenericResult: Unfinished Backtranslation 141.27/119.31 unknown boogie variable #memory_int 141.27/119.31 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 141.27/119.31 - PositiveResult [Line: 11]: pointer dereference always succeeds 141.27/119.31 For all program executions holds that pointer dereference always succeeds at this location 141.27/119.31 - PositiveResult [Line: 14]: pointer dereference always succeeds 141.27/119.31 For all program executions holds that pointer dereference always succeeds at this location 141.27/119.31 - PositiveResult [Line: 11]: pointer dereference always succeeds 141.27/119.31 For all program executions holds that pointer dereference always succeeds at this location 141.27/119.31 - PositiveResult [Line: 10]: pointer dereference always succeeds 141.27/119.31 For all program executions holds that pointer dereference always succeeds at this location 141.27/119.31 - PositiveResult [Line: 18]: pointer dereference always succeeds 141.27/119.31 For all program executions holds that pointer dereference always succeeds at this location 141.27/119.31 - PositiveResult [Line: 18]: pointer dereference always succeeds 141.27/119.31 For all program executions holds that pointer dereference always succeeds at this location 141.27/119.31 - PositiveResult [Line: 14]: pointer dereference always succeeds 141.27/119.31 For all program executions holds that pointer dereference always succeeds at this location 141.27/119.31 - PositiveResult [Line: 12]: pointer dereference always succeeds 141.27/119.31 For all program executions holds that pointer dereference always succeeds at this location 141.27/119.31 - PositiveResult [Line: 15]: pointer dereference always succeeds 141.27/119.31 For all program executions holds that pointer dereference always succeeds at this location 141.27/119.31 - PositiveResult [Line: 15]: pointer dereference always succeeds 141.27/119.31 For all program executions holds that pointer dereference always succeeds at this location 141.27/119.31 - PositiveResult [Line: 15]: pointer dereference always succeeds 141.27/119.31 For all program executions holds that pointer dereference always succeeds at this location 141.27/119.31 - PositiveResult [Line: 12]: pointer dereference always succeeds 141.27/119.31 For all program executions holds that pointer dereference always succeeds at this location 141.27/119.31 - PositiveResult [Line: 16]: pointer dereference always succeeds 141.27/119.31 For all program executions holds that pointer dereference always succeeds at this location 141.27/119.31 - PositiveResult [Line: 16]: pointer dereference always succeeds 141.27/119.31 For all program executions holds that pointer dereference always succeeds at this location 141.27/119.31 - PositiveResult [Line: 13]: pointer dereference always succeeds 141.27/119.31 For all program executions holds that pointer dereference always succeeds at this location 141.27/119.31 - PositiveResult [Line: 15]: pointer dereference always succeeds 141.27/119.31 For all program executions holds that pointer dereference always succeeds at this location 141.27/119.31 - PositiveResult [Line: 13]: pointer dereference always succeeds 141.27/119.31 For all program executions holds that pointer dereference always succeeds at this location 141.27/119.31 - PositiveResult [Line: 13]: pointer dereference always succeeds 141.27/119.31 For all program executions holds that pointer dereference always succeeds at this location 141.27/119.31 - PositiveResult [Line: 16]: pointer dereference always succeeds 141.27/119.31 For all program executions holds that pointer dereference always succeeds at this location 141.27/119.31 - PositiveResult [Line: 14]: pointer dereference always succeeds 141.27/119.31 For all program executions holds that pointer dereference always succeeds at this location 141.27/119.31 - PositiveResult [Line: 10]: pointer dereference always succeeds 141.27/119.31 For all program executions holds that pointer dereference always succeeds at this location 141.27/119.31 - PositiveResult [Line: 14]: pointer dereference always succeeds 141.27/119.31 For all program executions holds that pointer dereference always succeeds at this location 141.27/119.31 - PositiveResult [Line: 13]: pointer dereference always succeeds 141.27/119.31 For all program executions holds that pointer dereference always succeeds at this location 141.27/119.31 - PositiveResult [Line: 16]: pointer dereference always succeeds 141.27/119.31 For all program executions holds that pointer dereference always succeeds at this location 141.27/119.31 - AllSpecificationsHoldResult: All specifications hold 141.27/119.31 24 specifications checked. All of them hold 141.27/119.31 - InvariantResult [Line: 12]: Loop Invariant 141.27/119.31 [2019-03-28 12:42:11,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 141.27/119.31 [2019-03-28 12:42:11,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 141.27/119.31 [2019-03-28 12:42:11,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 141.27/119.31 [2019-03-28 12:42:11,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 141.27/119.31 [2019-03-28 12:42:11,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 141.27/119.31 [2019-03-28 12:42:11,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 141.27/119.31 Derived loop invariant: (((((((4 == unknown-#length-unknown[x_ref] && 0 == c) && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[c]) && 1 == \valid[c] 141.27/119.31 - StatisticsResult: Ultimate Automizer benchmark data 141.27/119.31 CFG has 1 procedures, 42 locations, 24 error locations. SAFE Result, 1.5s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 67 SDtfs, 342 SDslu, 6 SDs, 0 SdLazy, 368 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 141.27/119.31 - StatisticsResult: Constructed decomposition of program 141.27/119.31 Your program was decomposed into 5 terminating modules (2 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 26 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 20 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 16 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. 141.27/119.31 - StatisticsResult: Timing statistics 141.27/119.31 BüchiAutomizer plugin needed 112.5s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 5.4s. Construction of modules took 41.4s. Büchi inclusion checks took 65.6s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 133 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 87 SDtfs, 364 SDslu, 238 SDs, 0 SdLazy, 803 SolverSat, 80 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 41.4s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital435 mio100 ax100 hnf100 lsp98 ukn43 mio100 lsp38 div100 bol100 ite100 ukn100 eq191 hnf88 smp99 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 141.27/119.31 - TerminationAnalysisResult: Termination proven 141.27/119.31 Buchi Automizer proved that your program is terminating 141.27/119.31 RESULT: Ultimate proved your program to be correct! 141.27/119.31 !SESSION 2019-03-28 12:40:12.831 ----------------------------------------------- 141.27/119.31 eclipse.buildId=unknown 141.27/119.31 java.version=1.8.0_181 141.27/119.31 java.vendor=Oracle Corporation 141.27/119.31 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 141.27/119.31 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 141.27/119.31 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 141.27/119.31 141.27/119.31 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:42:11.450 141.27/119.31 !MESSAGE The workspace will exit with unsaved changes in this session. 141.27/119.31 Received shutdown request... 141.27/119.31 Ultimate: 141.27/119.31 GTK+ Version Check 141.27/119.31 EOF