358.21/292.47 YES 358.21/292.47 358.21/292.47 Ultimate: Cannot open display: 358.21/292.47 This is Ultimate 0.1.24-8dc7c08-m 358.21/292.47 [2019-03-28 12:36:15,252 INFO L170 SettingsManager]: Resetting all preferences to default values... 358.21/292.47 [2019-03-28 12:36:15,254 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 358.21/292.47 [2019-03-28 12:36:15,266 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 358.21/292.47 [2019-03-28 12:36:15,266 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 358.21/292.47 [2019-03-28 12:36:15,267 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 358.21/292.47 [2019-03-28 12:36:15,268 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 358.21/292.47 [2019-03-28 12:36:15,270 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 358.21/292.47 [2019-03-28 12:36:15,271 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 358.21/292.47 [2019-03-28 12:36:15,272 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 358.21/292.47 [2019-03-28 12:36:15,273 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 358.21/292.47 [2019-03-28 12:36:15,273 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 358.21/292.47 [2019-03-28 12:36:15,274 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 358.21/292.47 [2019-03-28 12:36:15,275 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 358.21/292.47 [2019-03-28 12:36:15,276 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 358.21/292.47 [2019-03-28 12:36:15,277 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 358.21/292.47 [2019-03-28 12:36:15,278 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 358.21/292.47 [2019-03-28 12:36:15,280 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 358.21/292.47 [2019-03-28 12:36:15,281 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 358.21/292.47 [2019-03-28 12:36:15,283 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 358.21/292.47 [2019-03-28 12:36:15,284 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 358.21/292.47 [2019-03-28 12:36:15,285 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 358.21/292.47 [2019-03-28 12:36:15,287 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 358.21/292.47 [2019-03-28 12:36:15,287 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 358.21/292.47 [2019-03-28 12:36:15,288 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 358.21/292.47 [2019-03-28 12:36:15,288 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 358.21/292.47 [2019-03-28 12:36:15,289 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 358.21/292.47 [2019-03-28 12:36:15,290 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 358.21/292.47 [2019-03-28 12:36:15,290 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 358.21/292.47 [2019-03-28 12:36:15,290 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 358.21/292.47 [2019-03-28 12:36:15,291 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 358.21/292.47 [2019-03-28 12:36:15,292 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 358.21/292.47 [2019-03-28 12:36:15,293 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 358.21/292.47 [2019-03-28 12:36:15,293 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 358.21/292.47 [2019-03-28 12:36:15,294 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 358.21/292.47 [2019-03-28 12:36:15,294 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 358.21/292.47 [2019-03-28 12:36:15,294 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 358.21/292.47 [2019-03-28 12:36:15,295 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 358.21/292.47 [2019-03-28 12:36:15,296 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 358.21/292.47 [2019-03-28 12:36:15,296 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 358.21/292.47 [2019-03-28 12:36:15,310 INFO L110 SettingsManager]: Loading preferences was successful 358.21/292.47 [2019-03-28 12:36:15,311 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 358.21/292.47 [2019-03-28 12:36:15,312 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 358.21/292.47 [2019-03-28 12:36:15,312 INFO L133 SettingsManager]: * Rewrite not-equals=true 358.21/292.47 [2019-03-28 12:36:15,312 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 358.21/292.47 [2019-03-28 12:36:15,312 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 358.21/292.47 [2019-03-28 12:36:15,312 INFO L133 SettingsManager]: * Use SBE=true 358.21/292.47 [2019-03-28 12:36:15,313 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 358.21/292.47 [2019-03-28 12:36:15,313 INFO L133 SettingsManager]: * Use old map elimination=false 358.21/292.47 [2019-03-28 12:36:15,313 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 358.21/292.47 [2019-03-28 12:36:15,313 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 358.21/292.47 [2019-03-28 12:36:15,313 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 358.21/292.47 [2019-03-28 12:36:15,313 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 358.21/292.47 [2019-03-28 12:36:15,314 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 358.21/292.47 [2019-03-28 12:36:15,314 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 358.21/292.47 [2019-03-28 12:36:15,314 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 358.21/292.47 [2019-03-28 12:36:15,314 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 358.21/292.47 [2019-03-28 12:36:15,314 INFO L133 SettingsManager]: * Check division by zero=IGNORE 358.21/292.47 [2019-03-28 12:36:15,315 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 358.21/292.47 [2019-03-28 12:36:15,315 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 358.21/292.47 [2019-03-28 12:36:15,315 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 358.21/292.47 [2019-03-28 12:36:15,315 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 358.21/292.47 [2019-03-28 12:36:15,315 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 358.21/292.47 [2019-03-28 12:36:15,315 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 358.21/292.47 [2019-03-28 12:36:15,316 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 358.21/292.47 [2019-03-28 12:36:15,316 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 358.21/292.47 [2019-03-28 12:36:15,316 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 358.21/292.47 [2019-03-28 12:36:15,316 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 358.21/292.47 [2019-03-28 12:36:15,316 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 358.21/292.47 [2019-03-28 12:36:15,342 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 358.21/292.47 [2019-03-28 12:36:15,355 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 358.21/292.47 [2019-03-28 12:36:15,358 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 358.21/292.47 [2019-03-28 12:36:15,360 INFO L271 PluginConnector]: Initializing CDTParser... 358.21/292.47 [2019-03-28 12:36:15,360 INFO L276 PluginConnector]: CDTParser initialized 358.21/292.47 [2019-03-28 12:36:15,361 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 358.21/292.47 [2019-03-28 12:36:15,457 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/47dd2aa99f754f2a9a0be323b3d5bcd3/FLAG0d0ea2ac3 358.21/292.47 [2019-03-28 12:36:15,799 INFO L307 CDTParser]: Found 1 translation units. 358.21/292.47 [2019-03-28 12:36:15,800 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 358.21/292.47 [2019-03-28 12:36:15,800 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 358.21/292.47 [2019-03-28 12:36:15,806 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/47dd2aa99f754f2a9a0be323b3d5bcd3/FLAG0d0ea2ac3 358.21/292.47 [2019-03-28 12:36:16,207 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/47dd2aa99f754f2a9a0be323b3d5bcd3 358.21/292.47 [2019-03-28 12:36:16,218 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 358.21/292.47 [2019-03-28 12:36:16,220 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 358.21/292.47 [2019-03-28 12:36:16,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 358.21/292.47 [2019-03-28 12:36:16,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 358.21/292.47 [2019-03-28 12:36:16,225 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 358.21/292.47 [2019-03-28 12:36:16,226 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:36:16" (1/1) ... 358.21/292.47 [2019-03-28 12:36:16,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c19def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:16, skipping insertion in model container 358.21/292.47 [2019-03-28 12:36:16,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:36:16" (1/1) ... 358.21/292.47 [2019-03-28 12:36:16,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 358.21/292.47 [2019-03-28 12:36:16,256 INFO L176 MainTranslator]: Built tables and reachable declarations 358.21/292.47 [2019-03-28 12:36:16,423 INFO L206 PostProcessor]: Analyzing one entry point: main 358.21/292.47 [2019-03-28 12:36:16,437 INFO L191 MainTranslator]: Completed pre-run 358.21/292.47 [2019-03-28 12:36:16,455 INFO L206 PostProcessor]: Analyzing one entry point: main 358.21/292.47 [2019-03-28 12:36:16,530 INFO L195 MainTranslator]: Completed translation 358.21/292.47 [2019-03-28 12:36:16,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:16 WrapperNode 358.21/292.47 [2019-03-28 12:36:16,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 358.21/292.47 [2019-03-28 12:36:16,532 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 358.21/292.47 [2019-03-28 12:36:16,532 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 358.21/292.47 [2019-03-28 12:36:16,532 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 358.21/292.47 [2019-03-28 12:36:16,542 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:36:16" (1/1) ... 358.21/292.47 [2019-03-28 12:36:16,550 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:36:16" (1/1) ... 358.21/292.47 [2019-03-28 12:36:16,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 358.21/292.47 [2019-03-28 12:36:16,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 358.21/292.47 [2019-03-28 12:36:16,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 358.21/292.47 [2019-03-28 12:36:16,572 INFO L276 PluginConnector]: Boogie Preprocessor initialized 358.21/292.47 [2019-03-28 12:36:16,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:16" (1/1) ... 358.21/292.47 [2019-03-28 12:36:16,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:16" (1/1) ... 358.21/292.47 [2019-03-28 12:36:16,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:16" (1/1) ... 358.21/292.47 [2019-03-28 12:36:16,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:16" (1/1) ... 358.21/292.47 [2019-03-28 12:36:16,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:16" (1/1) ... 358.21/292.47 [2019-03-28 12:36:16,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:16" (1/1) ... 358.21/292.47 [2019-03-28 12:36:16,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:16" (1/1) ... 358.21/292.47 [2019-03-28 12:36:16,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 358.21/292.47 [2019-03-28 12:36:16,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 358.21/292.47 [2019-03-28 12:36:16,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... 358.21/292.47 [2019-03-28 12:36:16,597 INFO L276 PluginConnector]: RCFGBuilder initialized 358.21/292.47 [2019-03-28 12:36:16,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:16" (1/1) ... 358.21/292.47 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 358.21/292.47 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 358.21/292.47 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 358.21/292.47 [2019-03-28 12:36:16,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 358.21/292.47 [2019-03-28 12:36:16,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 358.21/292.47 [2019-03-28 12:36:16,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 358.21/292.47 [2019-03-28 12:36:16,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 358.21/292.47 [2019-03-28 12:36:16,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 358.21/292.47 [2019-03-28 12:36:16,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 358.21/292.47 [2019-03-28 12:36:16,923 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 358.21/292.47 [2019-03-28 12:36:16,923 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. 358.21/292.47 [2019-03-28 12:36:16,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:36:16 BoogieIcfgContainer 358.21/292.47 [2019-03-28 12:36:16,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 358.21/292.47 [2019-03-28 12:36:16,926 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 358.21/292.47 [2019-03-28 12:36:16,926 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 358.21/292.47 [2019-03-28 12:36:16,928 INFO L276 PluginConnector]: BlockEncodingV2 initialized 358.21/292.47 [2019-03-28 12:36:16,929 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:36:16" (1/1) ... 358.21/292.47 [2019-03-28 12:36:16,947 INFO L313 BlockEncoder]: Initial Icfg 37 locations, 40 edges 358.21/292.47 [2019-03-28 12:36:16,949 INFO L258 BlockEncoder]: Using Remove infeasible edges 358.21/292.47 [2019-03-28 12:36:16,949 INFO L263 BlockEncoder]: Using Maximize final states 358.21/292.47 [2019-03-28 12:36:16,950 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 358.21/292.47 [2019-03-28 12:36:16,951 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 358.21/292.47 [2019-03-28 12:36:16,952 INFO L296 BlockEncoder]: Using Remove sink states 358.21/292.47 [2019-03-28 12:36:16,956 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 358.21/292.47 [2019-03-28 12:36:16,956 INFO L179 BlockEncoder]: Using Rewrite not-equals 358.21/292.47 [2019-03-28 12:36:16,981 INFO L185 BlockEncoder]: Using Use SBE 358.21/292.47 [2019-03-28 12:36:17,016 INFO L200 BlockEncoder]: SBE split 19 edges 358.21/292.47 [2019-03-28 12:36:17,022 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 358.21/292.47 [2019-03-28 12:36:17,024 INFO L71 MaximizeFinalStates]: 0 new accepting states 358.21/292.47 [2019-03-28 12:36:17,054 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding 358.21/292.47 [2019-03-28 12:36:17,057 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 358.21/292.47 [2019-03-28 12:36:17,059 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 358.21/292.47 [2019-03-28 12:36:17,059 INFO L71 MaximizeFinalStates]: 0 new accepting states 358.21/292.47 [2019-03-28 12:36:17,063 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 358.21/292.47 [2019-03-28 12:36:17,064 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 358.21/292.47 [2019-03-28 12:36:17,064 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 358.21/292.47 [2019-03-28 12:36:17,065 INFO L71 MaximizeFinalStates]: 0 new accepting states 358.21/292.47 [2019-03-28 12:36:17,065 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 358.21/292.47 [2019-03-28 12:36:17,066 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 358.21/292.47 [2019-03-28 12:36:17,066 INFO L313 BlockEncoder]: Encoded RCFG 30 locations, 56 edges 358.21/292.47 [2019-03-28 12:36:17,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:36:17 BasicIcfg 358.21/292.47 [2019-03-28 12:36:17,067 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 358.21/292.47 [2019-03-28 12:36:17,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 358.21/292.47 [2019-03-28 12:36:17,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... 358.21/292.47 [2019-03-28 12:36:17,072 INFO L276 PluginConnector]: TraceAbstraction initialized 358.21/292.47 [2019-03-28 12:36:17,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:36:16" (1/4) ... 358.21/292.47 [2019-03-28 12:36:17,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5269e55f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:36:17, skipping insertion in model container 358.21/292.47 [2019-03-28 12:36:17,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:16" (2/4) ... 358.21/292.47 [2019-03-28 12:36:17,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5269e55f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:36:17, skipping insertion in model container 358.21/292.47 [2019-03-28 12:36:17,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:36:16" (3/4) ... 358.21/292.47 [2019-03-28 12:36:17,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5269e55f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:36:17, skipping insertion in model container 358.21/292.47 [2019-03-28 12:36:17,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:36:17" (4/4) ... 358.21/292.47 [2019-03-28 12:36:17,076 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 358.21/292.47 [2019-03-28 12:36:17,089 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 358.21/292.47 [2019-03-28 12:36:17,098 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. 358.21/292.47 [2019-03-28 12:36:17,115 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. 358.21/292.47 [2019-03-28 12:36:17,144 INFO L133 ementStrategyFactory]: Using default assertion order modulation 358.21/292.47 [2019-03-28 12:36:17,145 INFO L382 AbstractCegarLoop]: Interprodecural is true 358.21/292.47 [2019-03-28 12:36:17,145 INFO L383 AbstractCegarLoop]: Hoare is true 358.21/292.47 [2019-03-28 12:36:17,145 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 358.21/292.47 [2019-03-28 12:36:17,146 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 358.21/292.47 [2019-03-28 12:36:17,146 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 358.21/292.47 [2019-03-28 12:36:17,146 INFO L387 AbstractCegarLoop]: Difference is false 358.21/292.47 [2019-03-28 12:36:17,146 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 358.21/292.47 [2019-03-28 12:36:17,146 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 358.21/292.47 [2019-03-28 12:36:17,162 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. 358.21/292.47 [2019-03-28 12:36:17,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 358.21/292.47 [2019-03-28 12:36:17,168 INFO L394 BasicCegarLoop]: Found error trace 358.21/292.47 [2019-03-28 12:36:17,169 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 358.21/292.47 [2019-03-28 12:36:17,169 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 358.21/292.47 [2019-03-28 12:36:17,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.47 [2019-03-28 12:36:17,175 INFO L82 PathProgramCache]: Analyzing trace with hash 129027, now seen corresponding path program 1 times 358.21/292.47 [2019-03-28 12:36:17,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.47 [2019-03-28 12:36:17,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.47 [2019-03-28 12:36:17,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.47 [2019-03-28 12:36:17,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.47 [2019-03-28 12:36:17,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.47 [2019-03-28 12:36:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.47 [2019-03-28 12:36:17,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 358.21/292.47 [2019-03-28 12:36:17,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 358.21/292.47 [2019-03-28 12:36:17,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 358.21/292.47 [2019-03-28 12:36:17,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 358.21/292.47 [2019-03-28 12:36:17,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 358.21/292.47 [2019-03-28 12:36:17,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 358.21/292.47 [2019-03-28 12:36:17,384 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. 358.21/292.47 [2019-03-28 12:36:17,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 358.21/292.47 [2019-03-28 12:36:17,537 INFO L93 Difference]: Finished difference Result 30 states and 56 transitions. 358.21/292.47 [2019-03-28 12:36:17,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 358.21/292.47 [2019-03-28 12:36:17,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 358.21/292.47 [2019-03-28 12:36:17,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 358.21/292.47 [2019-03-28 12:36:17,554 INFO L225 Difference]: With dead ends: 30 358.21/292.47 [2019-03-28 12:36:17,554 INFO L226 Difference]: Without dead ends: 26 358.21/292.47 [2019-03-28 12:36:17,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 358.21/292.47 [2019-03-28 12:36:17,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 358.21/292.47 [2019-03-28 12:36:17,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 358.21/292.47 [2019-03-28 12:36:17,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 358.21/292.47 [2019-03-28 12:36:17,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 48 transitions. 358.21/292.47 [2019-03-28 12:36:17,598 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 48 transitions. Word has length 3 358.21/292.47 [2019-03-28 12:36:17,599 INFO L84 Accepts]: Finished accepts. word is rejected. 358.21/292.47 [2019-03-28 12:36:17,599 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 48 transitions. 358.21/292.47 [2019-03-28 12:36:17,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 358.21/292.47 [2019-03-28 12:36:17,600 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 48 transitions. 358.21/292.47 [2019-03-28 12:36:17,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 358.21/292.47 [2019-03-28 12:36:17,600 INFO L394 BasicCegarLoop]: Found error trace 358.21/292.47 [2019-03-28 12:36:17,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 358.21/292.47 [2019-03-28 12:36:17,601 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 358.21/292.47 [2019-03-28 12:36:17,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.47 [2019-03-28 12:36:17,601 INFO L82 PathProgramCache]: Analyzing trace with hash 129029, now seen corresponding path program 1 times 358.21/292.47 [2019-03-28 12:36:17,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.47 [2019-03-28 12:36:17,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.47 [2019-03-28 12:36:17,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.47 [2019-03-28 12:36:17,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.47 [2019-03-28 12:36:17,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.47 [2019-03-28 12:36:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.47 [2019-03-28 12:36:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 358.21/292.47 [2019-03-28 12:36:17,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 358.21/292.47 [2019-03-28 12:36:17,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 358.21/292.47 [2019-03-28 12:36:17,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 358.21/292.47 [2019-03-28 12:36:17,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 358.21/292.47 [2019-03-28 12:36:17,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 358.21/292.47 [2019-03-28 12:36:17,645 INFO L87 Difference]: Start difference. First operand 26 states and 48 transitions. Second operand 3 states. 358.21/292.47 [2019-03-28 12:36:17,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 358.21/292.47 [2019-03-28 12:36:17,732 INFO L93 Difference]: Finished difference Result 26 states and 48 transitions. 358.21/292.47 [2019-03-28 12:36:17,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 358.21/292.47 [2019-03-28 12:36:17,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 358.21/292.47 [2019-03-28 12:36:17,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 358.21/292.47 [2019-03-28 12:36:17,734 INFO L225 Difference]: With dead ends: 26 358.21/292.47 [2019-03-28 12:36:17,734 INFO L226 Difference]: Without dead ends: 22 358.21/292.47 [2019-03-28 12:36:17,735 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 358.21/292.47 [2019-03-28 12:36:17,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 358.21/292.47 [2019-03-28 12:36:17,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 358.21/292.47 [2019-03-28 12:36:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 358.21/292.47 [2019-03-28 12:36:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 40 transitions. 358.21/292.47 [2019-03-28 12:36:17,740 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 40 transitions. Word has length 3 358.21/292.47 [2019-03-28 12:36:17,740 INFO L84 Accepts]: Finished accepts. word is rejected. 358.21/292.47 [2019-03-28 12:36:17,740 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 40 transitions. 358.21/292.47 [2019-03-28 12:36:17,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 358.21/292.47 [2019-03-28 12:36:17,740 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 40 transitions. 358.21/292.47 [2019-03-28 12:36:17,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 358.21/292.47 [2019-03-28 12:36:17,741 INFO L394 BasicCegarLoop]: Found error trace 358.21/292.47 [2019-03-28 12:36:17,741 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 358.21/292.47 [2019-03-28 12:36:17,741 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 358.21/292.47 [2019-03-28 12:36:17,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.47 [2019-03-28 12:36:17,742 INFO L82 PathProgramCache]: Analyzing trace with hash 3998668, now seen corresponding path program 1 times 358.21/292.47 [2019-03-28 12:36:17,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.47 [2019-03-28 12:36:17,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.47 [2019-03-28 12:36:17,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.47 [2019-03-28 12:36:17,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.47 [2019-03-28 12:36:17,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.47 [2019-03-28 12:36:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.47 [2019-03-28 12:36:17,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 358.21/292.47 [2019-03-28 12:36:17,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 358.21/292.47 [2019-03-28 12:36:17,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 358.21/292.47 [2019-03-28 12:36:17,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 358.21/292.47 [2019-03-28 12:36:17,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 358.21/292.47 [2019-03-28 12:36:17,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 358.21/292.47 [2019-03-28 12:36:17,777 INFO L87 Difference]: Start difference. First operand 22 states and 40 transitions. Second operand 3 states. 358.21/292.47 [2019-03-28 12:36:17,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 358.21/292.47 [2019-03-28 12:36:17,854 INFO L93 Difference]: Finished difference Result 22 states and 40 transitions. 358.21/292.47 [2019-03-28 12:36:17,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 358.21/292.47 [2019-03-28 12:36:17,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 358.21/292.47 [2019-03-28 12:36:17,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 358.21/292.47 [2019-03-28 12:36:17,856 INFO L225 Difference]: With dead ends: 22 358.21/292.47 [2019-03-28 12:36:17,856 INFO L226 Difference]: Without dead ends: 21 358.21/292.47 [2019-03-28 12:36:17,857 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 358.21/292.47 [2019-03-28 12:36:17,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. 358.21/292.47 [2019-03-28 12:36:17,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 358.21/292.47 [2019-03-28 12:36:17,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 358.21/292.47 [2019-03-28 12:36:17,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 38 transitions. 358.21/292.47 [2019-03-28 12:36:17,861 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 38 transitions. Word has length 4 358.21/292.47 [2019-03-28 12:36:17,861 INFO L84 Accepts]: Finished accepts. word is rejected. 358.21/292.47 [2019-03-28 12:36:17,861 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 38 transitions. 358.21/292.47 [2019-03-28 12:36:17,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 358.21/292.47 [2019-03-28 12:36:17,861 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 38 transitions. 358.21/292.47 [2019-03-28 12:36:17,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 358.21/292.47 [2019-03-28 12:36:17,862 INFO L394 BasicCegarLoop]: Found error trace 358.21/292.47 [2019-03-28 12:36:17,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 358.21/292.47 [2019-03-28 12:36:17,862 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 358.21/292.47 [2019-03-28 12:36:17,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.47 [2019-03-28 12:36:17,863 INFO L82 PathProgramCache]: Analyzing trace with hash 3998670, now seen corresponding path program 1 times 358.21/292.47 [2019-03-28 12:36:17,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.47 [2019-03-28 12:36:17,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.47 [2019-03-28 12:36:17,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.47 [2019-03-28 12:36:17,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.47 [2019-03-28 12:36:17,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.47 [2019-03-28 12:36:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.47 [2019-03-28 12:36:17,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 358.21/292.47 [2019-03-28 12:36:17,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 358.21/292.47 [2019-03-28 12:36:17,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 358.21/292.47 [2019-03-28 12:36:17,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 358.21/292.47 [2019-03-28 12:36:17,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 358.21/292.47 [2019-03-28 12:36:17,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 358.21/292.47 [2019-03-28 12:36:17,900 INFO L87 Difference]: Start difference. First operand 21 states and 38 transitions. Second operand 3 states. 358.21/292.47 [2019-03-28 12:36:17,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 358.21/292.47 [2019-03-28 12:36:17,964 INFO L93 Difference]: Finished difference Result 21 states and 38 transitions. 358.21/292.47 [2019-03-28 12:36:17,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 358.21/292.47 [2019-03-28 12:36:17,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 358.21/292.47 [2019-03-28 12:36:17,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 358.21/292.47 [2019-03-28 12:36:17,966 INFO L225 Difference]: With dead ends: 21 358.21/292.47 [2019-03-28 12:36:17,966 INFO L226 Difference]: Without dead ends: 20 358.21/292.47 [2019-03-28 12:36:17,966 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 358.21/292.47 [2019-03-28 12:36:17,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 358.21/292.47 [2019-03-28 12:36:17,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 358.21/292.47 [2019-03-28 12:36:17,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 358.21/292.47 [2019-03-28 12:36:17,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 36 transitions. 358.21/292.47 [2019-03-28 12:36:17,970 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 36 transitions. Word has length 4 358.21/292.47 [2019-03-28 12:36:17,970 INFO L84 Accepts]: Finished accepts. word is rejected. 358.21/292.47 [2019-03-28 12:36:17,971 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 36 transitions. 358.21/292.47 [2019-03-28 12:36:17,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 358.21/292.47 [2019-03-28 12:36:17,971 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 36 transitions. 358.21/292.47 [2019-03-28 12:36:17,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 358.21/292.47 [2019-03-28 12:36:17,971 INFO L394 BasicCegarLoop]: Found error trace 358.21/292.47 [2019-03-28 12:36:17,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 358.21/292.47 [2019-03-28 12:36:17,972 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 358.21/292.47 [2019-03-28 12:36:17,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.47 [2019-03-28 12:36:17,972 INFO L82 PathProgramCache]: Analyzing trace with hash 123959992, now seen corresponding path program 1 times 358.21/292.47 [2019-03-28 12:36:17,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.47 [2019-03-28 12:36:17,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.47 [2019-03-28 12:36:17,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.47 [2019-03-28 12:36:17,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.47 [2019-03-28 12:36:17,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.47 [2019-03-28 12:36:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.47 [2019-03-28 12:36:18,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 358.21/292.47 [2019-03-28 12:36:18,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 358.21/292.47 [2019-03-28 12:36:18,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 358.21/292.47 [2019-03-28 12:36:18,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 358.21/292.47 [2019-03-28 12:36:18,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 358.21/292.47 [2019-03-28 12:36:18,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 358.21/292.47 [2019-03-28 12:36:18,017 INFO L87 Difference]: Start difference. First operand 20 states and 36 transitions. Second operand 4 states. 358.21/292.47 [2019-03-28 12:36:18,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 358.21/292.47 [2019-03-28 12:36:18,126 INFO L93 Difference]: Finished difference Result 20 states and 36 transitions. 358.21/292.47 [2019-03-28 12:36:18,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 358.21/292.47 [2019-03-28 12:36:18,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 358.21/292.47 [2019-03-28 12:36:18,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 358.21/292.47 [2019-03-28 12:36:18,128 INFO L225 Difference]: With dead ends: 20 358.21/292.47 [2019-03-28 12:36:18,128 INFO L226 Difference]: Without dead ends: 16 358.21/292.47 [2019-03-28 12:36:18,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 358.21/292.47 [2019-03-28 12:36:18,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. 358.21/292.47 [2019-03-28 12:36:18,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. 358.21/292.47 [2019-03-28 12:36:18,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 358.21/292.47 [2019-03-28 12:36:18,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. 358.21/292.47 [2019-03-28 12:36:18,132 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 28 transitions. Word has length 5 358.21/292.47 [2019-03-28 12:36:18,132 INFO L84 Accepts]: Finished accepts. word is rejected. 358.21/292.47 [2019-03-28 12:36:18,132 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 28 transitions. 358.21/292.47 [2019-03-28 12:36:18,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 358.21/292.47 [2019-03-28 12:36:18,132 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 28 transitions. 358.21/292.47 [2019-03-28 12:36:18,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 358.21/292.47 [2019-03-28 12:36:18,133 INFO L394 BasicCegarLoop]: Found error trace 358.21/292.47 [2019-03-28 12:36:18,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 358.21/292.47 [2019-03-28 12:36:18,133 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 358.21/292.47 [2019-03-28 12:36:18,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.48 [2019-03-28 12:36:18,134 INFO L82 PathProgramCache]: Analyzing trace with hash 123959994, now seen corresponding path program 1 times 358.21/292.48 [2019-03-28 12:36:18,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.48 [2019-03-28 12:36:18,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.48 [2019-03-28 12:36:18,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:18,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:18,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.48 [2019-03-28 12:36:18,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 358.21/292.48 [2019-03-28 12:36:18,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 358.21/292.48 [2019-03-28 12:36:18,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 358.21/292.48 [2019-03-28 12:36:18,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 358.21/292.48 [2019-03-28 12:36:18,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 358.21/292.48 [2019-03-28 12:36:18,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 358.21/292.48 [2019-03-28 12:36:18,181 INFO L87 Difference]: Start difference. First operand 16 states and 28 transitions. Second operand 3 states. 358.21/292.48 [2019-03-28 12:36:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 358.21/292.48 [2019-03-28 12:36:18,252 INFO L93 Difference]: Finished difference Result 16 states and 28 transitions. 358.21/292.48 [2019-03-28 12:36:18,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 358.21/292.48 [2019-03-28 12:36:18,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 358.21/292.48 [2019-03-28 12:36:18,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 358.21/292.48 [2019-03-28 12:36:18,254 INFO L225 Difference]: With dead ends: 16 358.21/292.48 [2019-03-28 12:36:18,254 INFO L226 Difference]: Without dead ends: 0 358.21/292.48 [2019-03-28 12:36:18,254 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 358.21/292.48 [2019-03-28 12:36:18,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 358.21/292.48 [2019-03-28 12:36:18,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 358.21/292.48 [2019-03-28 12:36:18,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 358.21/292.48 [2019-03-28 12:36:18,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 358.21/292.48 [2019-03-28 12:36:18,255 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 358.21/292.48 [2019-03-28 12:36:18,255 INFO L84 Accepts]: Finished accepts. word is rejected. 358.21/292.48 [2019-03-28 12:36:18,256 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 358.21/292.48 [2019-03-28 12:36:18,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 358.21/292.48 [2019-03-28 12:36:18,256 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 358.21/292.48 [2019-03-28 12:36:18,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 358.21/292.48 [2019-03-28 12:36:18,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 358.21/292.48 [2019-03-28 12:36:18,323 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,323 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,323 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,323 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,323 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,324 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,324 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,324 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,324 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,324 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,324 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,324 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,324 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,325 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,325 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,325 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,325 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,326 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,326 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,326 INFO L448 ceAbstractionStarter]: For program point L9-1(lines 9 11) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,326 INFO L448 ceAbstractionStarter]: For program point L7-1(line 7) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,327 INFO L444 ceAbstractionStarter]: At program point L9-3(lines 8 11) the Hoare annotation is: (and (= 0 ULTIMATE.start_main_~n~0.offset) (= (select |#length| ULTIMATE.start_main_~n~0.base) 4) (= 0 ULTIMATE.start_main_~j~0.offset) (= (select |#valid| ULTIMATE.start_main_~n~0.base) 1) (= 4 (select |#length| ULTIMATE.start_main_~i~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~j~0.base)) (= 0 ULTIMATE.start_main_~i~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~i~0.base)) (= (select |#length| ULTIMATE.start_main_~j~0.base) 4)) 358.21/292.48 [2019-03-28 12:36:18,327 INFO L448 ceAbstractionStarter]: For program point L9-4(lines 9 11) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,327 INFO L444 ceAbstractionStarter]: At program point L7-4(lines 7 13) the Hoare annotation is: (and (= 0 ULTIMATE.start_main_~n~0.offset) (= (select |#length| ULTIMATE.start_main_~n~0.base) 4) (= 0 ULTIMATE.start_main_~j~0.offset) (= (select |#valid| ULTIMATE.start_main_~n~0.base) 1) (= 4 (select |#length| ULTIMATE.start_main_~i~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~j~0.base)) (= 0 ULTIMATE.start_main_~i~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~i~0.base)) (= (select |#length| ULTIMATE.start_main_~j~0.base) 4)) 358.21/292.48 [2019-03-28 12:36:18,327 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,327 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,327 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,328 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,328 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,328 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. 358.21/292.48 [2019-03-28 12:36:18,328 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 358.21/292.48 [2019-03-28 12:36:18,339 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 358.21/292.48 [2019-03-28 12:36:18,340 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 358.21/292.48 [2019-03-28 12:36:18,340 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 358.21/292.48 [2019-03-28 12:36:18,347 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 358.21/292.48 [2019-03-28 12:36:18,347 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 358.21/292.48 [2019-03-28 12:36:18,348 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 358.21/292.48 [2019-03-28 12:36:18,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 358.21/292.48 [2019-03-28 12:36:18,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 358.21/292.48 [2019-03-28 12:36:18,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 358.21/292.48 [2019-03-28 12:36:18,351 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 358.21/292.48 [2019-03-28 12:36:18,352 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 358.21/292.48 [2019-03-28 12:36:18,352 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 358.21/292.48 [2019-03-28 12:36:18,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:36:18 BasicIcfg 358.21/292.48 [2019-03-28 12:36:18,354 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 358.21/292.48 [2019-03-28 12:36:18,355 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 358.21/292.48 [2019-03-28 12:36:18,355 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 358.21/292.48 [2019-03-28 12:36:18,358 INFO L276 PluginConnector]: BuchiAutomizer initialized 358.21/292.48 [2019-03-28 12:36:18,359 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 358.21/292.48 [2019-03-28 12:36:18,360 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:36:16" (1/5) ... 358.21/292.48 [2019-03-28 12:36:18,360 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c87a5ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:36:18, skipping insertion in model container 358.21/292.48 [2019-03-28 12:36:18,360 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 358.21/292.48 [2019-03-28 12:36:18,360 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:16" (2/5) ... 358.21/292.48 [2019-03-28 12:36:18,361 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c87a5ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:36:18, skipping insertion in model container 358.21/292.48 [2019-03-28 12:36:18,361 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 358.21/292.48 [2019-03-28 12:36:18,362 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:36:16" (3/5) ... 358.21/292.48 [2019-03-28 12:36:18,362 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c87a5ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:36:18, skipping insertion in model container 358.21/292.48 [2019-03-28 12:36:18,362 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 358.21/292.48 [2019-03-28 12:36:18,362 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:36:17" (4/5) ... 358.21/292.48 [2019-03-28 12:36:18,363 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c87a5ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:36:18, skipping insertion in model container 358.21/292.48 [2019-03-28 12:36:18,363 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 358.21/292.48 [2019-03-28 12:36:18,363 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:36:18" (5/5) ... 358.21/292.48 [2019-03-28 12:36:18,365 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 358.21/292.48 [2019-03-28 12:36:18,385 INFO L133 ementStrategyFactory]: Using default assertion order modulation 358.21/292.48 [2019-03-28 12:36:18,386 INFO L374 BuchiCegarLoop]: Interprodecural is true 358.21/292.48 [2019-03-28 12:36:18,386 INFO L375 BuchiCegarLoop]: Hoare is true 358.21/292.48 [2019-03-28 12:36:18,386 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 358.21/292.48 [2019-03-28 12:36:18,386 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 358.21/292.48 [2019-03-28 12:36:18,386 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 358.21/292.48 [2019-03-28 12:36:18,387 INFO L379 BuchiCegarLoop]: Difference is false 358.21/292.48 [2019-03-28 12:36:18,387 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 358.21/292.48 [2019-03-28 12:36:18,387 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 358.21/292.48 [2019-03-28 12:36:18,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. 358.21/292.48 [2019-03-28 12:36:18,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 358.21/292.48 [2019-03-28 12:36:18,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 358.21/292.48 [2019-03-28 12:36:18,397 INFO L119 BuchiIsEmpty]: Starting construction of run 358.21/292.48 [2019-03-28 12:36:18,401 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 358.21/292.48 [2019-03-28 12:36:18,401 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 358.21/292.48 [2019-03-28 12:36:18,401 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 358.21/292.48 [2019-03-28 12:36:18,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. 358.21/292.48 [2019-03-28 12:36:18,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 358.21/292.48 [2019-03-28 12:36:18,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 358.21/292.48 [2019-03-28 12:36:18,404 INFO L119 BuchiIsEmpty]: Starting construction of run 358.21/292.48 [2019-03-28 12:36:18,404 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 358.21/292.48 [2019-03-28 12:36:18,404 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 358.21/292.48 [2019-03-28 12:36:18,410 INFO L794 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue [99] 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] 14#L-1true [127] L-1-->L7-4: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 21#L7-4true 358.21/292.48 [2019-03-28 12:36:18,410 INFO L796 eck$LassoCheckResult]: Loop: 21#L7-4true [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 6#L7-1true [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 27#L8true [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 7#L9-3true [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 12#L9true [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 10#L9-1true [116] L9-1-->L9-4: Formula: (> |v_ULTIMATE.start_main_#t~mem5_4| |v_ULTIMATE.start_main_#t~mem6_4|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 4#L9-4true [62] L9-4-->L12: Formula: (and (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_10)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 18#L12true [169] L12-->L7-4: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem8_6| 1))) |v_#memory_int_15|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 21#L7-4true 358.21/292.48 [2019-03-28 12:36:18,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.48 [2019-03-28 12:36:18,411 INFO L82 PathProgramCache]: Analyzing trace with hash 4157, now seen corresponding path program 1 times 358.21/292.48 [2019-03-28 12:36:18,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.48 [2019-03-28 12:36:18,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.48 [2019-03-28 12:36:18,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:18,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:18,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:18,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.48 [2019-03-28 12:36:18,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1550084622, now seen corresponding path program 1 times 358.21/292.48 [2019-03-28 12:36:18,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.48 [2019-03-28 12:36:18,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.48 [2019-03-28 12:36:18,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:18,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:18,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:18,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.48 [2019-03-28 12:36:18,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1433032146, now seen corresponding path program 1 times 358.21/292.48 [2019-03-28 12:36:18,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.48 [2019-03-28 12:36:18,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.48 [2019-03-28 12:36:18,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:18,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:18,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:18,790 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 358.21/292.48 [2019-03-28 12:36:18,875 INFO L216 LassoAnalysis]: Preferences: 358.21/292.48 [2019-03-28 12:36:18,876 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 358.21/292.48 [2019-03-28 12:36:18,877 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 358.21/292.48 [2019-03-28 12:36:18,877 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 358.21/292.48 [2019-03-28 12:36:18,877 INFO L127 ssoRankerPreferences]: Use exernal solver: false 358.21/292.48 [2019-03-28 12:36:18,877 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 358.21/292.48 [2019-03-28 12:36:18,877 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 358.21/292.48 [2019-03-28 12:36:18,877 INFO L130 ssoRankerPreferences]: Path of dumped script: 358.21/292.48 [2019-03-28 12:36:18,878 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 358.21/292.48 [2019-03-28 12:36:18,878 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 358.21/292.48 [2019-03-28 12:36:18,878 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 358.21/292.48 [2019-03-28 12:36:18,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:18,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:18,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:18,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:19,158 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 358.21/292.48 [2019-03-28 12:36:19,278 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 358.21/292.48 [2019-03-28 12:36:19,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:19,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:19,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:19,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:19,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:19,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:19,668 INFO L300 LassoAnalysis]: Preprocessing complete. 358.21/292.48 [2019-03-28 12:36:19,674 INFO L497 LassoAnalysis]: Using template 'affine'. 358.21/292.48 [2019-03-28 12:36:19,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:19,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:19,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:19,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:19,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:19,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:19,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:19,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:19,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:19,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:19,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:19,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:19,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:19,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:19,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:19,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:19,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:19,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:19,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:19,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:19,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:19,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:19,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:19,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:19,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:19,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:19,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:19,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:19,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:19,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:19,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:19,699 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:19,699 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:19,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:19,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:19,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:19,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:19,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:19,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:19,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:19,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:19,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:19,717 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 358.21/292.48 [2019-03-28 12:36:19,722 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 358.21/292.48 [2019-03-28 12:36:19,722 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 358.21/292.48 [2019-03-28 12:36:19,724 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 358.21/292.48 [2019-03-28 12:36:19,725 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 358.21/292.48 [2019-03-28 12:36:19,725 INFO L518 LassoAnalysis]: Proved termination. 358.21/292.48 [2019-03-28 12:36:19,725 INFO L520 LassoAnalysis]: Termination argument consisting of: 358.21/292.48 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1 358.21/292.48 Supporting invariants [] 358.21/292.48 [2019-03-28 12:36:19,794 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed 358.21/292.48 [2019-03-28 12:36:19,798 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 358.21/292.48 [2019-03-28 12:36:19,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.48 [2019-03-28 12:36:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.48 [2019-03-28 12:36:19,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core 358.21/292.48 [2019-03-28 12:36:19,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.48 [2019-03-28 12:36:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.48 [2019-03-28 12:36:19,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 358.21/292.48 [2019-03-28 12:36:19,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.48 [2019-03-28 12:36:19,902 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.48 [2019-03-28 12:36:19,903 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 358.21/292.48 [2019-03-28 12:36:19,908 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.48 [2019-03-28 12:36:19,933 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size 358.21/292.48 [2019-03-28 12:36:19,934 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 358.21/292.48 [2019-03-28 12:36:19,934 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 358.21/292.48 [2019-03-28 12:36:20,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 358.21/292.48 [2019-03-28 12:36:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.48 [2019-03-28 12:36:20,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 358.21/292.48 [2019-03-28 12:36:20,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.48 [2019-03-28 12:36:20,293 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.48 [2019-03-28 12:36:20,293 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 358.21/292.48 [2019-03-28 12:36:20,295 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.48 [2019-03-28 12:36:20,314 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size 358.21/292.48 [2019-03-28 12:36:20,314 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 358.21/292.48 [2019-03-28 12:36:20,314 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 358.21/292.48 [2019-03-28 12:36:20,349 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.48 [2019-03-28 12:36:20,350 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 71 358.21/292.48 [2019-03-28 12:36:20,352 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.48 [2019-03-28 12:36:20,379 INFO L497 ElimStorePlain]: treesize reduction 26, result has 55.9 percent of original size 358.21/292.48 [2019-03-28 12:36:20,381 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. 358.21/292.48 [2019-03-28 12:36:20,381 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 358.21/292.48 [2019-03-28 12:36:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:20,533 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.48 [2019-03-28 12:36:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:20,546 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.48 [2019-03-28 12:36:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:20,556 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.48 [2019-03-28 12:36:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:20,567 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.48 [2019-03-28 12:36:20,567 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 14 predicates after loop cannibalization 358.21/292.48 [2019-03-28 12:36:20,571 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 14 loop predicates 358.21/292.48 [2019-03-28 12:36:20,572 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states. Second operand 8 states. 358.21/292.48 [2019-03-28 12:36:24,456 WARN L188 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 33 DAG size of output: 25 358.21/292.48 [2019-03-28 12:36:24,878 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states.. Second operand 8 states. Result 184 states and 317 transitions. Complement of second has 31 states. 358.21/292.48 [2019-03-28 12:36:24,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 14 non-accepting loop states 2 accepting loop states 358.21/292.48 [2019-03-28 12:36:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 358.21/292.48 [2019-03-28 12:36:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 188 transitions. 358.21/292.48 [2019-03-28 12:36:24,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 188 transitions. Stem has 2 letters. Loop has 8 letters. 358.21/292.48 [2019-03-28 12:36:24,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.48 [2019-03-28 12:36:24,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 188 transitions. Stem has 10 letters. Loop has 8 letters. 358.21/292.48 [2019-03-28 12:36:24,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.48 [2019-03-28 12:36:24,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 188 transitions. Stem has 2 letters. Loop has 16 letters. 358.21/292.48 [2019-03-28 12:36:24,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.48 [2019-03-28 12:36:24,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 317 transitions. 358.21/292.48 [2019-03-28 12:36:24,904 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 358.21/292.48 [2019-03-28 12:36:24,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 64 states and 78 transitions. 358.21/292.48 [2019-03-28 12:36:24,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 358.21/292.48 [2019-03-28 12:36:24,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 358.21/292.48 [2019-03-28 12:36:24,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 78 transitions. 358.21/292.48 [2019-03-28 12:36:24,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 358.21/292.48 [2019-03-28 12:36:24,908 INFO L706 BuchiCegarLoop]: Abstraction has 64 states and 78 transitions. 358.21/292.48 [2019-03-28 12:36:24,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 78 transitions. 358.21/292.48 [2019-03-28 12:36:24,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 42. 358.21/292.48 [2019-03-28 12:36:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 358.21/292.48 [2019-03-28 12:36:24,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. 358.21/292.48 [2019-03-28 12:36:24,913 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. 358.21/292.48 [2019-03-28 12:36:24,914 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. 358.21/292.48 [2019-03-28 12:36:24,914 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 358.21/292.48 [2019-03-28 12:36:24,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. 358.21/292.48 [2019-03-28 12:36:24,915 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 358.21/292.48 [2019-03-28 12:36:24,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 358.21/292.48 [2019-03-28 12:36:24,915 INFO L119 BuchiIsEmpty]: Starting construction of run 358.21/292.48 [2019-03-28 12:36:24,916 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 358.21/292.48 [2019-03-28 12:36:24,916 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 358.21/292.48 [2019-03-28 12:36:24,916 INFO L794 eck$LassoCheckResult]: Stem: 469#ULTIMATE.startENTRY [99] 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] 458#L-1 [126] L-1-->L7-4: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 459#L7-4 358.21/292.48 [2019-03-28 12:36:24,917 INFO L796 eck$LassoCheckResult]: Loop: 459#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 496#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 495#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 487#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 491#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 492#L9-1 [116] L9-1-->L9-4: Formula: (> |v_ULTIMATE.start_main_#t~mem5_4| |v_ULTIMATE.start_main_#t~mem6_4|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 465#L9-4 [62] L9-4-->L12: Formula: (and (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_10)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 466#L12 [169] L12-->L7-4: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem8_6| 1))) |v_#memory_int_15|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 459#L7-4 358.21/292.48 [2019-03-28 12:36:24,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.48 [2019-03-28 12:36:24,917 INFO L82 PathProgramCache]: Analyzing trace with hash 4156, now seen corresponding path program 1 times 358.21/292.48 [2019-03-28 12:36:24,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.48 [2019-03-28 12:36:24,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.48 [2019-03-28 12:36:24,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:24,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:24,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:24,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.48 [2019-03-28 12:36:24,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1550084622, now seen corresponding path program 2 times 358.21/292.48 [2019-03-28 12:36:24,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.48 [2019-03-28 12:36:24,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.48 [2019-03-28 12:36:24,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:24,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:24,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:24,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.48 [2019-03-28 12:36:24,949 INFO L82 PathProgramCache]: Analyzing trace with hash 374422317, now seen corresponding path program 1 times 358.21/292.48 [2019-03-28 12:36:24,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.48 [2019-03-28 12:36:24,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.48 [2019-03-28 12:36:24,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:24,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:24,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:25,194 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 358.21/292.48 [2019-03-28 12:36:25,253 INFO L216 LassoAnalysis]: Preferences: 358.21/292.48 [2019-03-28 12:36:25,253 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 358.21/292.48 [2019-03-28 12:36:25,254 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 358.21/292.48 [2019-03-28 12:36:25,254 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 358.21/292.48 [2019-03-28 12:36:25,254 INFO L127 ssoRankerPreferences]: Use exernal solver: false 358.21/292.48 [2019-03-28 12:36:25,254 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 358.21/292.48 [2019-03-28 12:36:25,254 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 358.21/292.48 [2019-03-28 12:36:25,254 INFO L130 ssoRankerPreferences]: Path of dumped script: 358.21/292.48 [2019-03-28 12:36:25,254 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 358.21/292.48 [2019-03-28 12:36:25,255 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 358.21/292.48 [2019-03-28 12:36:25,255 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 358.21/292.48 [2019-03-28 12:36:25,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:25,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:25,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:25,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:25,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:25,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:25,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:25,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:25,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:25,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:25,464 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 358.21/292.48 [2019-03-28 12:36:25,901 INFO L300 LassoAnalysis]: Preprocessing complete. 358.21/292.48 [2019-03-28 12:36:25,901 INFO L497 LassoAnalysis]: Using template 'affine'. 358.21/292.48 [2019-03-28 12:36:25,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:25,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:25,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:25,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:25,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:25,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:25,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:25,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:25,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:25,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:25,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:25,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:25,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:25,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:25,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:25,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:25,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:25,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:25,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:25,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:25,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:25,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:25,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:25,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:25,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:25,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:25,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:25,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:25,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:25,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:25,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:25,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:25,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:25,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:25,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:25,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:25,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:25,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:25,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:25,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:25,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:25,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:25,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:25,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:25,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:25,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:25,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:25,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:25,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:25,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:25,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:25,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:25,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:25,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:25,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:25,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:25,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:25,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:25,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:25,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:25,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:25,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:25,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:25,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:25,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:25,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:25,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:25,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:25,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:25,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:25,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:25,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:25,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:25,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:25,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:25,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:25,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:25,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:25,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:25,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:25,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:25,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:25,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:25,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:25,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:25,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:25,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:25,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:25,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:25,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:25,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:25,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:25,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:25,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:25,935 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:25,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:25,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:25,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:25,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:25,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:25,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:25,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:25,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:25,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:25,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:25,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:25,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:25,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:25,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:25,955 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:25,955 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:25,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:25,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:25,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:25,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:25,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:25,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:25,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:25,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:25,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:25,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:25,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:25,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:25,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:25,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:25,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:25,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:25,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:25,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:25,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:25,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:25,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:25,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:25,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:25,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:25,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:25,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:25,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:25,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:25,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:25,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:25,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:25,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:25,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:25,993 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 358.21/292.48 [2019-03-28 12:36:25,996 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 358.21/292.48 [2019-03-28 12:36:25,996 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. 358.21/292.48 [2019-03-28 12:36:25,997 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 358.21/292.48 [2019-03-28 12:36:25,997 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 358.21/292.48 [2019-03-28 12:36:25,997 INFO L518 LassoAnalysis]: Proved termination. 358.21/292.48 [2019-03-28 12:36:25,997 INFO L520 LassoAnalysis]: Termination argument consisting of: 358.21/292.48 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_2 358.21/292.48 Supporting invariants [] 358.21/292.48 [2019-03-28 12:36:26,060 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed 358.21/292.48 [2019-03-28 12:36:26,062 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 358.21/292.48 [2019-03-28 12:36:26,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.48 [2019-03-28 12:36:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.48 [2019-03-28 12:36:26,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core 358.21/292.48 [2019-03-28 12:36:26,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.48 [2019-03-28 12:36:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.48 [2019-03-28 12:36:26,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 358.21/292.48 [2019-03-28 12:36:26,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.48 [2019-03-28 12:36:26,133 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.48 [2019-03-28 12:36:26,134 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 358.21/292.48 [2019-03-28 12:36:26,135 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.48 [2019-03-28 12:36:26,168 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size 358.21/292.48 [2019-03-28 12:36:26,169 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 358.21/292.48 [2019-03-28 12:36:26,169 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 358.21/292.48 [2019-03-28 12:36:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 358.21/292.48 [2019-03-28 12:36:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.48 [2019-03-28 12:36:26,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 358.21/292.48 [2019-03-28 12:36:26,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.48 [2019-03-28 12:36:26,475 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.48 [2019-03-28 12:36:26,476 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 358.21/292.48 [2019-03-28 12:36:26,477 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.48 [2019-03-28 12:36:26,496 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size 358.21/292.48 [2019-03-28 12:36:26,496 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 358.21/292.48 [2019-03-28 12:36:26,497 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 358.21/292.48 [2019-03-28 12:36:26,529 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.48 [2019-03-28 12:36:26,529 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 71 358.21/292.48 [2019-03-28 12:36:26,531 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.48 [2019-03-28 12:36:26,558 INFO L497 ElimStorePlain]: treesize reduction 26, result has 55.9 percent of original size 358.21/292.48 [2019-03-28 12:36:26,559 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. 358.21/292.48 [2019-03-28 12:36:26,560 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 358.21/292.48 [2019-03-28 12:36:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:26,714 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.48 [2019-03-28 12:36:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:26,723 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.48 [2019-03-28 12:36:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:26,732 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.48 [2019-03-28 12:36:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:26,741 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.48 [2019-03-28 12:36:26,741 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 14 predicates after loop cannibalization 358.21/292.48 [2019-03-28 12:36:26,741 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 14 loop predicates 358.21/292.48 [2019-03-28 12:36:26,742 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16 Second operand 8 states. 358.21/292.48 [2019-03-28 12:36:28,192 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 96 states and 116 transitions. Complement of second has 31 states. 358.21/292.48 [2019-03-28 12:36:28,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 14 non-accepting loop states 2 accepting loop states 358.21/292.48 [2019-03-28 12:36:28,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 358.21/292.48 [2019-03-28 12:36:28,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 52 transitions. 358.21/292.48 [2019-03-28 12:36:28,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 8 letters. 358.21/292.48 [2019-03-28 12:36:28,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.48 [2019-03-28 12:36:28,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 10 letters. Loop has 8 letters. 358.21/292.48 [2019-03-28 12:36:28,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.48 [2019-03-28 12:36:28,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 16 letters. 358.21/292.48 [2019-03-28 12:36:28,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.48 [2019-03-28 12:36:28,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 116 transitions. 358.21/292.48 [2019-03-28 12:36:28,202 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 358.21/292.48 [2019-03-28 12:36:28,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 94 states and 113 transitions. 358.21/292.48 [2019-03-28 12:36:28,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 358.21/292.48 [2019-03-28 12:36:28,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 358.21/292.48 [2019-03-28 12:36:28,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 113 transitions. 358.21/292.48 [2019-03-28 12:36:28,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 358.21/292.48 [2019-03-28 12:36:28,205 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 113 transitions. 358.21/292.48 [2019-03-28 12:36:28,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 113 transitions. 358.21/292.48 [2019-03-28 12:36:28,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 42. 358.21/292.48 [2019-03-28 12:36:28,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 358.21/292.48 [2019-03-28 12:36:28,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. 358.21/292.48 [2019-03-28 12:36:28,209 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. 358.21/292.48 [2019-03-28 12:36:28,209 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. 358.21/292.48 [2019-03-28 12:36:28,209 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 358.21/292.48 [2019-03-28 12:36:28,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. 358.21/292.48 [2019-03-28 12:36:28,210 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 358.21/292.48 [2019-03-28 12:36:28,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 358.21/292.48 [2019-03-28 12:36:28,210 INFO L119 BuchiIsEmpty]: Starting construction of run 358.21/292.48 [2019-03-28 12:36:28,211 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 358.21/292.48 [2019-03-28 12:36:28,211 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 358.21/292.48 [2019-03-28 12:36:28,211 INFO L794 eck$LassoCheckResult]: Stem: 848#ULTIMATE.startENTRY [99] 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] 837#L-1 [125] L-1-->L7-4: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 838#L7-4 358.21/292.48 [2019-03-28 12:36:28,212 INFO L796 eck$LassoCheckResult]: Loop: 838#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 869#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 867#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 868#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 874#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 872#L9-1 [116] L9-1-->L9-4: Formula: (> |v_ULTIMATE.start_main_#t~mem5_4| |v_ULTIMATE.start_main_#t~mem6_4|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 871#L9-4 [62] L9-4-->L12: Formula: (and (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_10)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 870#L12 [169] L12-->L7-4: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem8_6| 1))) |v_#memory_int_15|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 838#L7-4 358.21/292.48 [2019-03-28 12:36:28,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.48 [2019-03-28 12:36:28,213 INFO L82 PathProgramCache]: Analyzing trace with hash 4155, now seen corresponding path program 1 times 358.21/292.48 [2019-03-28 12:36:28,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.48 [2019-03-28 12:36:28,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.48 [2019-03-28 12:36:28,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:28,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:28,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:28,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.48 [2019-03-28 12:36:28,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1550084622, now seen corresponding path program 3 times 358.21/292.48 [2019-03-28 12:36:28,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.48 [2019-03-28 12:36:28,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.48 [2019-03-28 12:36:28,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:28,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:28,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:28,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.48 [2019-03-28 12:36:28,242 INFO L82 PathProgramCache]: Analyzing trace with hash -2113090516, now seen corresponding path program 1 times 358.21/292.48 [2019-03-28 12:36:28,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.48 [2019-03-28 12:36:28,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.48 [2019-03-28 12:36:28,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:28,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:28,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:28,577 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 358.21/292.48 [2019-03-28 12:36:28,644 INFO L216 LassoAnalysis]: Preferences: 358.21/292.48 [2019-03-28 12:36:28,644 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 358.21/292.48 [2019-03-28 12:36:28,644 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 358.21/292.48 [2019-03-28 12:36:28,644 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 358.21/292.48 [2019-03-28 12:36:28,645 INFO L127 ssoRankerPreferences]: Use exernal solver: false 358.21/292.48 [2019-03-28 12:36:28,645 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 358.21/292.48 [2019-03-28 12:36:28,645 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 358.21/292.48 [2019-03-28 12:36:28,645 INFO L130 ssoRankerPreferences]: Path of dumped script: 358.21/292.48 [2019-03-28 12:36:28,645 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 358.21/292.48 [2019-03-28 12:36:28,645 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 358.21/292.48 [2019-03-28 12:36:28,645 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 358.21/292.48 [2019-03-28 12:36:28,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:28,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:28,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:28,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:28,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:28,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:28,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:28,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:28,856 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 358.21/292.48 [2019-03-28 12:36:28,969 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 358.21/292.48 [2019-03-28 12:36:28,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:28,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:29,294 INFO L300 LassoAnalysis]: Preprocessing complete. 358.21/292.48 [2019-03-28 12:36:29,294 INFO L497 LassoAnalysis]: Using template 'affine'. 358.21/292.48 [2019-03-28 12:36:29,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:29,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:29,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:29,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:29,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:29,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:29,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:29,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:29,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:29,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:29,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:29,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:29,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:29,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:29,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:29,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:29,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:29,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:29,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:29,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:29,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:29,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:29,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:29,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:29,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:29,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:29,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:29,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:29,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:29,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:29,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:29,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:29,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:29,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:29,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:29,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:29,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:29,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:29,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:29,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:29,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:29,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:29,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:29,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:29,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:29,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:29,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:29,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:29,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:29,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:29,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:29,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:29,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:29,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:29,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:29,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:29,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:29,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:29,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:29,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:29,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:29,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:29,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:29,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:29,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:29,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:29,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:29,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:29,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:29,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:29,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:29,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:29,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:29,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:29,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:29,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:29,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:29,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:29,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:29,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:29,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:29,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:29,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:29,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:29,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:29,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:29,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:29,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:29,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:29,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:29,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:29,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:29,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:29,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:29,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:29,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:29,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:29,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:29,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:29,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:29,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:29,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:29,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:29,358 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 358.21/292.48 [2019-03-28 12:36:29,360 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 358.21/292.48 [2019-03-28 12:36:29,360 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. 358.21/292.48 [2019-03-28 12:36:29,360 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 358.21/292.48 [2019-03-28 12:36:29,360 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 358.21/292.48 [2019-03-28 12:36:29,361 INFO L518 LassoAnalysis]: Proved termination. 358.21/292.48 [2019-03-28 12:36:29,361 INFO L520 LassoAnalysis]: Termination argument consisting of: 358.21/292.48 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_3 358.21/292.48 Supporting invariants [] 358.21/292.48 [2019-03-28 12:36:29,424 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed 358.21/292.48 [2019-03-28 12:36:29,425 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 358.21/292.48 [2019-03-28 12:36:29,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.48 [2019-03-28 12:36:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.48 [2019-03-28 12:36:29,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core 358.21/292.48 [2019-03-28 12:36:29,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.48 [2019-03-28 12:36:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.48 [2019-03-28 12:36:29,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 358.21/292.48 [2019-03-28 12:36:29,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.48 [2019-03-28 12:36:29,488 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.48 [2019-03-28 12:36:29,488 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 358.21/292.48 [2019-03-28 12:36:29,490 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.48 [2019-03-28 12:36:29,515 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size 358.21/292.48 [2019-03-28 12:36:29,516 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 358.21/292.48 [2019-03-28 12:36:29,516 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 358.21/292.48 [2019-03-28 12:36:29,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 358.21/292.48 [2019-03-28 12:36:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.48 [2019-03-28 12:36:29,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 358.21/292.48 [2019-03-28 12:36:29,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.48 [2019-03-28 12:36:29,858 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.48 [2019-03-28 12:36:29,858 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 358.21/292.48 [2019-03-28 12:36:29,860 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.48 [2019-03-28 12:36:29,880 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size 358.21/292.48 [2019-03-28 12:36:29,881 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 358.21/292.48 [2019-03-28 12:36:29,881 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 358.21/292.48 [2019-03-28 12:36:29,920 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.48 [2019-03-28 12:36:29,921 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 71 358.21/292.48 [2019-03-28 12:36:29,923 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.48 [2019-03-28 12:36:29,954 INFO L497 ElimStorePlain]: treesize reduction 26, result has 55.9 percent of original size 358.21/292.48 [2019-03-28 12:36:29,955 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. 358.21/292.48 [2019-03-28 12:36:29,955 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 358.21/292.48 [2019-03-28 12:36:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:30,118 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.48 [2019-03-28 12:36:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:30,126 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.48 [2019-03-28 12:36:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:30,134 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.48 [2019-03-28 12:36:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:30,142 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.48 [2019-03-28 12:36:30,142 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 14 predicates after loop cannibalization 358.21/292.48 [2019-03-28 12:36:30,143 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 14 loop predicates 358.21/292.48 [2019-03-28 12:36:30,143 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16 Second operand 8 states. 358.21/292.48 [2019-03-28 12:36:32,604 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 96 states and 116 transitions. Complement of second has 31 states. 358.21/292.48 [2019-03-28 12:36:32,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 14 non-accepting loop states 2 accepting loop states 358.21/292.48 [2019-03-28 12:36:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 358.21/292.48 [2019-03-28 12:36:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 52 transitions. 358.21/292.48 [2019-03-28 12:36:32,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 8 letters. 358.21/292.48 [2019-03-28 12:36:32,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.48 [2019-03-28 12:36:32,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 10 letters. Loop has 8 letters. 358.21/292.48 [2019-03-28 12:36:32,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.48 [2019-03-28 12:36:32,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 16 letters. 358.21/292.48 [2019-03-28 12:36:32,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.48 [2019-03-28 12:36:32,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 116 transitions. 358.21/292.48 [2019-03-28 12:36:32,613 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 358.21/292.48 [2019-03-28 12:36:32,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 94 states and 113 transitions. 358.21/292.48 [2019-03-28 12:36:32,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 358.21/292.48 [2019-03-28 12:36:32,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 358.21/292.48 [2019-03-28 12:36:32,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 113 transitions. 358.21/292.48 [2019-03-28 12:36:32,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 358.21/292.48 [2019-03-28 12:36:32,615 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 113 transitions. 358.21/292.48 [2019-03-28 12:36:32,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 113 transitions. 358.21/292.48 [2019-03-28 12:36:32,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 42. 358.21/292.48 [2019-03-28 12:36:32,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 358.21/292.48 [2019-03-28 12:36:32,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. 358.21/292.48 [2019-03-28 12:36:32,619 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. 358.21/292.48 [2019-03-28 12:36:32,619 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. 358.21/292.48 [2019-03-28 12:36:32,619 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 358.21/292.48 [2019-03-28 12:36:32,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. 358.21/292.48 [2019-03-28 12:36:32,620 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 358.21/292.48 [2019-03-28 12:36:32,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 358.21/292.48 [2019-03-28 12:36:32,620 INFO L119 BuchiIsEmpty]: Starting construction of run 358.21/292.48 [2019-03-28 12:36:32,621 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 358.21/292.48 [2019-03-28 12:36:32,621 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 358.21/292.48 [2019-03-28 12:36:32,621 INFO L794 eck$LassoCheckResult]: Stem: 1227#ULTIMATE.startENTRY [99] 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] 1216#L-1 [124] L-1-->L7-4: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 1217#L7-4 358.21/292.48 [2019-03-28 12:36:32,622 INFO L796 eck$LassoCheckResult]: Loop: 1217#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1247#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 1245#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 1246#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1252#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 1250#L9-1 [116] L9-1-->L9-4: Formula: (> |v_ULTIMATE.start_main_#t~mem5_4| |v_ULTIMATE.start_main_#t~mem6_4|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 1249#L9-4 [62] L9-4-->L12: Formula: (and (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_10)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 1248#L12 [169] L12-->L7-4: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem8_6| 1))) |v_#memory_int_15|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 1217#L7-4 358.21/292.48 [2019-03-28 12:36:32,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.48 [2019-03-28 12:36:32,622 INFO L82 PathProgramCache]: Analyzing trace with hash 4154, now seen corresponding path program 1 times 358.21/292.48 [2019-03-28 12:36:32,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.48 [2019-03-28 12:36:32,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.48 [2019-03-28 12:36:32,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:32,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:32,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:32,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.48 [2019-03-28 12:36:32,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1550084622, now seen corresponding path program 4 times 358.21/292.48 [2019-03-28 12:36:32,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.48 [2019-03-28 12:36:32,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.48 [2019-03-28 12:36:32,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:32,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:32,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:32,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.48 [2019-03-28 12:36:32,647 INFO L82 PathProgramCache]: Analyzing trace with hash -305636053, now seen corresponding path program 1 times 358.21/292.48 [2019-03-28 12:36:32,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.48 [2019-03-28 12:36:32,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.48 [2019-03-28 12:36:32,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:32,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:32,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:32,915 INFO L216 LassoAnalysis]: Preferences: 358.21/292.48 [2019-03-28 12:36:32,915 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 358.21/292.48 [2019-03-28 12:36:32,915 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 358.21/292.48 [2019-03-28 12:36:32,915 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 358.21/292.48 [2019-03-28 12:36:32,916 INFO L127 ssoRankerPreferences]: Use exernal solver: false 358.21/292.48 [2019-03-28 12:36:32,916 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 358.21/292.48 [2019-03-28 12:36:32,916 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 358.21/292.48 [2019-03-28 12:36:32,916 INFO L130 ssoRankerPreferences]: Path of dumped script: 358.21/292.48 [2019-03-28 12:36:32,916 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 358.21/292.48 [2019-03-28 12:36:32,916 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 358.21/292.48 [2019-03-28 12:36:32,916 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 358.21/292.48 [2019-03-28 12:36:32,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:32,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:32,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:32,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:32,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:32,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:33,136 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 358.21/292.48 [2019-03-28 12:36:33,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:33,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:33,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:33,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:33,569 INFO L300 LassoAnalysis]: Preprocessing complete. 358.21/292.48 [2019-03-28 12:36:33,569 INFO L497 LassoAnalysis]: Using template 'affine'. 358.21/292.48 [2019-03-28 12:36:33,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:33,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:33,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:33,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:33,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:33,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:33,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:33,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:33,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:33,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:33,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:33,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:33,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:33,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:33,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:33,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:33,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:33,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:33,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:33,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:33,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:33,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:33,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:33,576 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:33,576 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:33,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:33,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:33,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:33,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:33,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:33,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:33,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:33,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:33,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:33,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:33,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:33,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:33,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:33,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:33,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:33,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:33,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:33,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:33,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:33,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:33,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:33,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:33,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:33,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:33,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:33,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:33,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:33,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:33,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:33,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:33,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:33,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:33,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:33,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:33,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:33,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:33,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:33,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:33,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:33,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:33,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:33,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:33,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:33,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:33,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:33,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:33,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:33,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:33,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:33,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:33,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:33,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:33,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:33,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:33,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:33,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:33,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:33,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:33,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:33,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:33,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:33,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:33,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:33,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:33,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:33,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:33,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:33,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:33,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:33,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:33,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:33,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:33,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:33,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:33,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:33,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:33,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:33,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:33,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:33,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:33,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:33,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:33,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:33,639 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 358.21/292.48 [2019-03-28 12:36:33,641 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 358.21/292.48 [2019-03-28 12:36:33,641 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 358.21/292.48 [2019-03-28 12:36:33,641 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 358.21/292.48 [2019-03-28 12:36:33,641 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 358.21/292.48 [2019-03-28 12:36:33,642 INFO L518 LassoAnalysis]: Proved termination. 358.21/292.48 [2019-03-28 12:36:33,642 INFO L520 LassoAnalysis]: Termination argument consisting of: 358.21/292.48 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_4) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_4 358.21/292.48 Supporting invariants [] 358.21/292.48 [2019-03-28 12:36:33,704 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed 358.21/292.48 [2019-03-28 12:36:33,706 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 358.21/292.48 [2019-03-28 12:36:33,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.48 [2019-03-28 12:36:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.48 [2019-03-28 12:36:33,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core 358.21/292.48 [2019-03-28 12:36:33,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.48 [2019-03-28 12:36:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.48 [2019-03-28 12:36:33,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 358.21/292.48 [2019-03-28 12:36:33,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.48 [2019-03-28 12:36:33,751 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.48 [2019-03-28 12:36:33,752 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 358.21/292.48 [2019-03-28 12:36:33,753 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.48 [2019-03-28 12:36:33,772 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size 358.21/292.48 [2019-03-28 12:36:33,772 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 358.21/292.48 [2019-03-28 12:36:33,772 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 358.21/292.48 [2019-03-28 12:36:33,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 358.21/292.48 [2019-03-28 12:36:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.48 [2019-03-28 12:36:34,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 358.21/292.48 [2019-03-28 12:36:34,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.48 [2019-03-28 12:36:34,068 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.48 [2019-03-28 12:36:34,068 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 358.21/292.48 [2019-03-28 12:36:34,070 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.48 [2019-03-28 12:36:34,090 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size 358.21/292.48 [2019-03-28 12:36:34,090 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 358.21/292.48 [2019-03-28 12:36:34,090 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 358.21/292.48 [2019-03-28 12:36:34,122 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.48 [2019-03-28 12:36:34,122 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 71 358.21/292.48 [2019-03-28 12:36:34,124 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.48 [2019-03-28 12:36:34,151 INFO L497 ElimStorePlain]: treesize reduction 26, result has 55.9 percent of original size 358.21/292.48 [2019-03-28 12:36:34,152 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. 358.21/292.48 [2019-03-28 12:36:34,152 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 358.21/292.48 [2019-03-28 12:36:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:34,300 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.48 [2019-03-28 12:36:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:34,308 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.48 [2019-03-28 12:36:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:34,318 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.48 [2019-03-28 12:36:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:34,327 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.48 [2019-03-28 12:36:34,327 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 14 predicates after loop cannibalization 358.21/292.48 [2019-03-28 12:36:34,327 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 14 loop predicates 358.21/292.48 [2019-03-28 12:36:34,327 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16 Second operand 8 states. 358.21/292.48 [2019-03-28 12:36:35,387 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 96 states and 116 transitions. Complement of second has 31 states. 358.21/292.48 [2019-03-28 12:36:35,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 14 non-accepting loop states 2 accepting loop states 358.21/292.48 [2019-03-28 12:36:35,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 358.21/292.48 [2019-03-28 12:36:35,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 52 transitions. 358.21/292.48 [2019-03-28 12:36:35,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 8 letters. 358.21/292.48 [2019-03-28 12:36:35,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.48 [2019-03-28 12:36:35,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 10 letters. Loop has 8 letters. 358.21/292.48 [2019-03-28 12:36:35,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.48 [2019-03-28 12:36:35,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 16 letters. 358.21/292.48 [2019-03-28 12:36:35,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.48 [2019-03-28 12:36:35,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 116 transitions. 358.21/292.48 [2019-03-28 12:36:35,396 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 358.21/292.48 [2019-03-28 12:36:35,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 94 states and 113 transitions. 358.21/292.48 [2019-03-28 12:36:35,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 358.21/292.48 [2019-03-28 12:36:35,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 358.21/292.48 [2019-03-28 12:36:35,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 113 transitions. 358.21/292.48 [2019-03-28 12:36:35,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 358.21/292.48 [2019-03-28 12:36:35,398 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 113 transitions. 358.21/292.48 [2019-03-28 12:36:35,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 113 transitions. 358.21/292.48 [2019-03-28 12:36:35,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 42. 358.21/292.48 [2019-03-28 12:36:35,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 358.21/292.48 [2019-03-28 12:36:35,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. 358.21/292.48 [2019-03-28 12:36:35,402 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. 358.21/292.48 [2019-03-28 12:36:35,402 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. 358.21/292.48 [2019-03-28 12:36:35,402 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 358.21/292.48 [2019-03-28 12:36:35,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. 358.21/292.48 [2019-03-28 12:36:35,403 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 358.21/292.48 [2019-03-28 12:36:35,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 358.21/292.48 [2019-03-28 12:36:35,403 INFO L119 BuchiIsEmpty]: Starting construction of run 358.21/292.48 [2019-03-28 12:36:35,404 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 358.21/292.48 [2019-03-28 12:36:35,404 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 358.21/292.48 [2019-03-28 12:36:35,404 INFO L794 eck$LassoCheckResult]: Stem: 1606#ULTIMATE.startENTRY [99] 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] 1595#L-1 [123] L-1-->L7-4: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 1596#L7-4 358.21/292.48 [2019-03-28 12:36:35,405 INFO L796 eck$LassoCheckResult]: Loop: 1596#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1627#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 1625#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 1626#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1632#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 1630#L9-1 [116] L9-1-->L9-4: Formula: (> |v_ULTIMATE.start_main_#t~mem5_4| |v_ULTIMATE.start_main_#t~mem6_4|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 1629#L9-4 [62] L9-4-->L12: Formula: (and (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_10)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 1628#L12 [169] L12-->L7-4: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem8_6| 1))) |v_#memory_int_15|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 1596#L7-4 358.21/292.48 [2019-03-28 12:36:35,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.48 [2019-03-28 12:36:35,405 INFO L82 PathProgramCache]: Analyzing trace with hash 4153, now seen corresponding path program 1 times 358.21/292.48 [2019-03-28 12:36:35,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.48 [2019-03-28 12:36:35,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.48 [2019-03-28 12:36:35,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:35,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:35,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:35,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.48 [2019-03-28 12:36:35,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1550084622, now seen corresponding path program 5 times 358.21/292.48 [2019-03-28 12:36:35,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.48 [2019-03-28 12:36:35,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.48 [2019-03-28 12:36:35,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:35,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:35,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:35,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.48 [2019-03-28 12:36:35,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1501818410, now seen corresponding path program 1 times 358.21/292.48 [2019-03-28 12:36:35,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.48 [2019-03-28 12:36:35,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.48 [2019-03-28 12:36:35,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:35,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:35,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.48 [2019-03-28 12:36:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.48 [2019-03-28 12:36:35,671 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 358.21/292.48 [2019-03-28 12:36:35,732 INFO L216 LassoAnalysis]: Preferences: 358.21/292.48 [2019-03-28 12:36:35,732 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 358.21/292.48 [2019-03-28 12:36:35,732 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 358.21/292.48 [2019-03-28 12:36:35,732 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 358.21/292.48 [2019-03-28 12:36:35,732 INFO L127 ssoRankerPreferences]: Use exernal solver: false 358.21/292.48 [2019-03-28 12:36:35,733 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 358.21/292.48 [2019-03-28 12:36:35,733 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 358.21/292.48 [2019-03-28 12:36:35,733 INFO L130 ssoRankerPreferences]: Path of dumped script: 358.21/292.48 [2019-03-28 12:36:35,733 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 358.21/292.48 [2019-03-28 12:36:35,733 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 358.21/292.48 [2019-03-28 12:36:35,733 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 358.21/292.48 [2019-03-28 12:36:35,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:35,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:35,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:35,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:35,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:35,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:35,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:35,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:35,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:35,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.48 [2019-03-28 12:36:35,928 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 358.21/292.48 [2019-03-28 12:36:36,331 INFO L300 LassoAnalysis]: Preprocessing complete. 358.21/292.48 [2019-03-28 12:36:36,331 INFO L497 LassoAnalysis]: Using template 'affine'. 358.21/292.48 [2019-03-28 12:36:36,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:36,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:36,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:36,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:36,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:36,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:36,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:36,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:36,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:36,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:36,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:36,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:36,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:36,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:36,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:36,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:36,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:36,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:36,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:36,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:36,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:36,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:36,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:36,339 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:36,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:36,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:36,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:36,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:36,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:36,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:36,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:36,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:36,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:36,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:36,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:36,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:36,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:36,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:36,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:36,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:36,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:36,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:36,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:36,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:36,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:36,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:36,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:36,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:36,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:36,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:36,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:36,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:36,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:36,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:36,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:36,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:36,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:36,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:36,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:36,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:36,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:36,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:36,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:36,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:36,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:36,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:36,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:36,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:36,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:36,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:36,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:36,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:36,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:36,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:36,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:36,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:36,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:36,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:36,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:36,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:36,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:36,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:36,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:36,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:36,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:36,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:36,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:36,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:36,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:36,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:36,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:36,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:36,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:36,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:36,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:36,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:36,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:36,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:36,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:36,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:36,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:36,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:36,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:36,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:36,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:36,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:36,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:36,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:36,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:36,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:36,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:36,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:36,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:36,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:36,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:36,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:36,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:36,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:36,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:36,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:36,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:36,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:36,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:36,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:36,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:36,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:36,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:36,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:36,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:36,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:36,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:36,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:36,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:36,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:36,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:36,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:36,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:36,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:36,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:36,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:36,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:36,390 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:36,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:36,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.48 [2019-03-28 12:36:36,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.48 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.48 Number of strict supporting invariants: 0 358.21/292.48 Number of non-strict supporting invariants: 1 358.21/292.48 Consider only non-deceasing supporting invariants: true 358.21/292.48 Simplify termination arguments: true 358.21/292.48 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.48 [2019-03-28 12:36:36,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.48 [2019-03-28 12:36:36,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.48 [2019-03-28 12:36:36,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.48 [2019-03-28 12:36:36,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.48 [2019-03-28 12:36:36,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.48 [2019-03-28 12:36:36,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.48 [2019-03-28 12:36:36,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.48 [2019-03-28 12:36:36,405 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 358.21/292.48 [2019-03-28 12:36:36,406 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 358.21/292.48 [2019-03-28 12:36:36,407 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 358.21/292.48 [2019-03-28 12:36:36,407 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 358.21/292.48 [2019-03-28 12:36:36,407 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 358.21/292.48 [2019-03-28 12:36:36,407 INFO L518 LassoAnalysis]: Proved termination. 358.21/292.48 [2019-03-28 12:36:36,407 INFO L520 LassoAnalysis]: Termination argument consisting of: 358.21/292.48 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_5) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_5 358.21/292.48 Supporting invariants [] 358.21/292.48 [2019-03-28 12:36:36,471 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed 358.21/292.48 [2019-03-28 12:36:36,472 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 358.21/292.48 [2019-03-28 12:36:36,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.48 [2019-03-28 12:36:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.48 [2019-03-28 12:36:36,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core 358.21/292.48 [2019-03-28 12:36:36,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.48 [2019-03-28 12:36:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.48 [2019-03-28 12:36:36,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 358.21/292.48 [2019-03-28 12:36:36,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.48 [2019-03-28 12:36:36,526 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.48 [2019-03-28 12:36:36,527 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 358.21/292.48 [2019-03-28 12:36:36,528 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.48 [2019-03-28 12:36:36,549 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size 358.21/292.48 [2019-03-28 12:36:36,549 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 358.21/292.48 [2019-03-28 12:36:36,549 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 358.21/292.48 [2019-03-28 12:36:36,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 358.21/292.48 [2019-03-28 12:36:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.48 [2019-03-28 12:36:36,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 358.21/292.48 [2019-03-28 12:36:36,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.48 [2019-03-28 12:36:36,853 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.48 [2019-03-28 12:36:36,853 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 358.21/292.49 [2019-03-28 12:36:36,855 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:36,873 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size 358.21/292.49 [2019-03-28 12:36:36,874 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:36,874 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 358.21/292.49 [2019-03-28 12:36:36,905 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:36:36,906 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 71 358.21/292.49 [2019-03-28 12:36:36,908 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:36,938 INFO L497 ElimStorePlain]: treesize reduction 26, result has 55.9 percent of original size 358.21/292.49 [2019-03-28 12:36:36,939 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. 358.21/292.49 [2019-03-28 12:36:36,940 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 358.21/292.49 [2019-03-28 12:36:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:37,085 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:36:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:37,093 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:36:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:37,101 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:36:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:37,109 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:36:37,109 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 14 predicates after loop cannibalization 358.21/292.49 [2019-03-28 12:36:37,110 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 14 loop predicates 358.21/292.49 [2019-03-28 12:36:37,110 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16 Second operand 8 states. 358.21/292.49 [2019-03-28 12:36:38,805 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 96 states and 116 transitions. Complement of second has 31 states. 358.21/292.49 [2019-03-28 12:36:38,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 14 non-accepting loop states 2 accepting loop states 358.21/292.49 [2019-03-28 12:36:38,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 358.21/292.49 [2019-03-28 12:36:38,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 52 transitions. 358.21/292.49 [2019-03-28 12:36:38,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 8 letters. 358.21/292.49 [2019-03-28 12:36:38,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.49 [2019-03-28 12:36:38,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 10 letters. Loop has 8 letters. 358.21/292.49 [2019-03-28 12:36:38,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.49 [2019-03-28 12:36:38,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 16 letters. 358.21/292.49 [2019-03-28 12:36:38,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.49 [2019-03-28 12:36:38,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 116 transitions. 358.21/292.49 [2019-03-28 12:36:38,813 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 358.21/292.49 [2019-03-28 12:36:38,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 94 states and 113 transitions. 358.21/292.49 [2019-03-28 12:36:38,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 358.21/292.49 [2019-03-28 12:36:38,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 358.21/292.49 [2019-03-28 12:36:38,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 113 transitions. 358.21/292.49 [2019-03-28 12:36:38,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 358.21/292.49 [2019-03-28 12:36:38,815 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 113 transitions. 358.21/292.49 [2019-03-28 12:36:38,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 113 transitions. 358.21/292.49 [2019-03-28 12:36:38,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 42. 358.21/292.49 [2019-03-28 12:36:38,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 358.21/292.49 [2019-03-28 12:36:38,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. 358.21/292.49 [2019-03-28 12:36:38,819 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. 358.21/292.49 [2019-03-28 12:36:38,819 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. 358.21/292.49 [2019-03-28 12:36:38,819 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 358.21/292.49 [2019-03-28 12:36:38,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. 358.21/292.49 [2019-03-28 12:36:38,819 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 358.21/292.49 [2019-03-28 12:36:38,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 358.21/292.49 [2019-03-28 12:36:38,820 INFO L119 BuchiIsEmpty]: Starting construction of run 358.21/292.49 [2019-03-28 12:36:38,820 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 358.21/292.49 [2019-03-28 12:36:38,820 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 358.21/292.49 [2019-03-28 12:36:38,820 INFO L794 eck$LassoCheckResult]: Stem: 1985#ULTIMATE.startENTRY [99] 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] 1974#L-1 [122] L-1-->L7-4: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 1975#L7-4 358.21/292.49 [2019-03-28 12:36:38,821 INFO L796 eck$LassoCheckResult]: Loop: 1975#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 2006#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 2004#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 2005#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 2011#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 2009#L9-1 [116] L9-1-->L9-4: Formula: (> |v_ULTIMATE.start_main_#t~mem5_4| |v_ULTIMATE.start_main_#t~mem6_4|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 2008#L9-4 [62] L9-4-->L12: Formula: (and (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_10)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 2007#L12 [169] L12-->L7-4: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem8_6| 1))) |v_#memory_int_15|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 1975#L7-4 358.21/292.49 [2019-03-28 12:36:38,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.49 [2019-03-28 12:36:38,821 INFO L82 PathProgramCache]: Analyzing trace with hash 4152, now seen corresponding path program 1 times 358.21/292.49 [2019-03-28 12:36:38,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.49 [2019-03-28 12:36:38,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.49 [2019-03-28 12:36:38,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:38,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:38,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:38,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.49 [2019-03-28 12:36:38,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1550084622, now seen corresponding path program 6 times 358.21/292.49 [2019-03-28 12:36:38,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.49 [2019-03-28 12:36:38,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.49 [2019-03-28 12:36:38,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:38,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:38,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:38,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.49 [2019-03-28 12:36:38,843 INFO L82 PathProgramCache]: Analyzing trace with hash -985694423, now seen corresponding path program 1 times 358.21/292.49 [2019-03-28 12:36:38,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.49 [2019-03-28 12:36:38,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.49 [2019-03-28 12:36:38,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:38,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:38,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:39,096 INFO L216 LassoAnalysis]: Preferences: 358.21/292.49 [2019-03-28 12:36:39,097 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 358.21/292.49 [2019-03-28 12:36:39,097 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 358.21/292.49 [2019-03-28 12:36:39,097 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 358.21/292.49 [2019-03-28 12:36:39,097 INFO L127 ssoRankerPreferences]: Use exernal solver: false 358.21/292.49 [2019-03-28 12:36:39,097 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 358.21/292.49 [2019-03-28 12:36:39,097 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 358.21/292.49 [2019-03-28 12:36:39,097 INFO L130 ssoRankerPreferences]: Path of dumped script: 358.21/292.49 [2019-03-28 12:36:39,098 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso 358.21/292.49 [2019-03-28 12:36:39,098 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 358.21/292.49 [2019-03-28 12:36:39,098 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 358.21/292.49 [2019-03-28 12:36:39,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:39,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:39,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:39,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:39,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:39,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:39,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:39,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:39,313 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 358.21/292.49 [2019-03-28 12:36:39,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:39,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:39,738 INFO L300 LassoAnalysis]: Preprocessing complete. 358.21/292.49 [2019-03-28 12:36:39,738 INFO L497 LassoAnalysis]: Using template 'affine'. 358.21/292.49 [2019-03-28 12:36:39,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:39,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:39,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:36:39,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:39,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:39,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:39,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:39,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:39,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:39,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:39,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:39,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:39,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:39,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:39,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:39,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:39,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:39,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:39,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:39,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:36:39,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:39,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:39,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:39,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:39,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:39,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:39,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:39,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:39,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:36:39,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:39,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:39,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:39,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:39,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:39,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:39,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:39,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:39,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:36:39,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:39,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:39,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:39,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:39,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:39,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:39,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:39,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:39,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:39,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:39,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:39,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:39,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:39,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:39,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:39,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:39,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:36:39,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:39,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:39,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:39,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:39,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:39,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:39,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:39,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:39,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:39,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:39,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:39,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:39,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:39,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:39,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:39,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:39,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:36:39,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:39,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:39,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:39,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:39,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:39,762 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 358.21/292.49 [2019-03-28 12:36:39,763 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 358.21/292.49 [2019-03-28 12:36:39,763 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 358.21/292.49 [2019-03-28 12:36:39,765 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 358.21/292.49 [2019-03-28 12:36:39,765 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 358.21/292.49 [2019-03-28 12:36:39,765 INFO L518 LassoAnalysis]: Proved termination. 358.21/292.49 [2019-03-28 12:36:39,765 INFO L520 LassoAnalysis]: Termination argument consisting of: 358.21/292.49 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_6) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_6 358.21/292.49 Supporting invariants [] 358.21/292.49 [2019-03-28 12:36:39,822 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed 358.21/292.49 [2019-03-28 12:36:39,823 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 358.21/292.49 [2019-03-28 12:36:39,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.49 [2019-03-28 12:36:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.49 [2019-03-28 12:36:39,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core 358.21/292.49 [2019-03-28 12:36:39,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.49 [2019-03-28 12:36:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.49 [2019-03-28 12:36:39,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 358.21/292.49 [2019-03-28 12:36:39,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.49 [2019-03-28 12:36:39,867 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:36:39,867 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 358.21/292.49 [2019-03-28 12:36:39,869 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:39,887 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size 358.21/292.49 [2019-03-28 12:36:39,887 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:39,888 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 358.21/292.49 [2019-03-28 12:36:39,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 358.21/292.49 [2019-03-28 12:36:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.49 [2019-03-28 12:36:40,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 358.21/292.49 [2019-03-28 12:36:40,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.49 [2019-03-28 12:36:40,182 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:36:40,183 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 358.21/292.49 [2019-03-28 12:36:40,184 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:40,203 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size 358.21/292.49 [2019-03-28 12:36:40,204 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:40,204 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 358.21/292.49 [2019-03-28 12:36:40,247 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:36:40,247 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 71 358.21/292.49 [2019-03-28 12:36:40,249 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:40,275 INFO L497 ElimStorePlain]: treesize reduction 26, result has 55.9 percent of original size 358.21/292.49 [2019-03-28 12:36:40,276 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. 358.21/292.49 [2019-03-28 12:36:40,276 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 358.21/292.49 [2019-03-28 12:36:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:40,452 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:36:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:40,460 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:36:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:40,469 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:36:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:40,477 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:36:40,477 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 14 predicates after loop cannibalization 358.21/292.49 [2019-03-28 12:36:40,478 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 14 loop predicates 358.21/292.49 [2019-03-28 12:36:40,478 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16 Second operand 8 states. 358.21/292.49 [2019-03-28 12:36:41,575 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 96 states and 116 transitions. Complement of second has 31 states. 358.21/292.49 [2019-03-28 12:36:41,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 14 non-accepting loop states 2 accepting loop states 358.21/292.49 [2019-03-28 12:36:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 358.21/292.49 [2019-03-28 12:36:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 52 transitions. 358.21/292.49 [2019-03-28 12:36:41,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 8 letters. 358.21/292.49 [2019-03-28 12:36:41,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.49 [2019-03-28 12:36:41,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 10 letters. Loop has 8 letters. 358.21/292.49 [2019-03-28 12:36:41,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.49 [2019-03-28 12:36:41,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 16 letters. 358.21/292.49 [2019-03-28 12:36:41,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.49 [2019-03-28 12:36:41,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 116 transitions. 358.21/292.49 [2019-03-28 12:36:41,583 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 358.21/292.49 [2019-03-28 12:36:41,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 94 states and 113 transitions. 358.21/292.49 [2019-03-28 12:36:41,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 358.21/292.49 [2019-03-28 12:36:41,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 358.21/292.49 [2019-03-28 12:36:41,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 113 transitions. 358.21/292.49 [2019-03-28 12:36:41,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 358.21/292.49 [2019-03-28 12:36:41,585 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 113 transitions. 358.21/292.49 [2019-03-28 12:36:41,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 113 transitions. 358.21/292.49 [2019-03-28 12:36:41,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 42. 358.21/292.49 [2019-03-28 12:36:41,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 358.21/292.49 [2019-03-28 12:36:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. 358.21/292.49 [2019-03-28 12:36:41,588 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. 358.21/292.49 [2019-03-28 12:36:41,588 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. 358.21/292.49 [2019-03-28 12:36:41,588 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 358.21/292.49 [2019-03-28 12:36:41,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. 358.21/292.49 [2019-03-28 12:36:41,589 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 358.21/292.49 [2019-03-28 12:36:41,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 358.21/292.49 [2019-03-28 12:36:41,589 INFO L119 BuchiIsEmpty]: Starting construction of run 358.21/292.49 [2019-03-28 12:36:41,589 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 358.21/292.49 [2019-03-28 12:36:41,589 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 358.21/292.49 [2019-03-28 12:36:41,590 INFO L794 eck$LassoCheckResult]: Stem: 2364#ULTIMATE.startENTRY [99] 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] 2353#L-1 [121] L-1-->L7-4: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 2354#L7-4 358.21/292.49 [2019-03-28 12:36:41,590 INFO L796 eck$LassoCheckResult]: Loop: 2354#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 2386#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 2384#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 2385#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 2391#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 2389#L9-1 [116] L9-1-->L9-4: Formula: (> |v_ULTIMATE.start_main_#t~mem5_4| |v_ULTIMATE.start_main_#t~mem6_4|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 2388#L9-4 [62] L9-4-->L12: Formula: (and (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_10)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 2387#L12 [169] L12-->L7-4: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem8_6| 1))) |v_#memory_int_15|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 2354#L7-4 358.21/292.49 [2019-03-28 12:36:41,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.49 [2019-03-28 12:36:41,591 INFO L82 PathProgramCache]: Analyzing trace with hash 4151, now seen corresponding path program 1 times 358.21/292.49 [2019-03-28 12:36:41,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.49 [2019-03-28 12:36:41,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.49 [2019-03-28 12:36:41,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:41,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:41,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:41,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.49 [2019-03-28 12:36:41,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1550084622, now seen corresponding path program 7 times 358.21/292.49 [2019-03-28 12:36:41,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.49 [2019-03-28 12:36:41,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.49 [2019-03-28 12:36:41,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:41,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:41,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:41,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.49 [2019-03-28 12:36:41,610 INFO L82 PathProgramCache]: Analyzing trace with hash 821760040, now seen corresponding path program 1 times 358.21/292.49 [2019-03-28 12:36:41,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.49 [2019-03-28 12:36:41,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.49 [2019-03-28 12:36:41,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:41,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:41,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:41,836 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 358.21/292.49 [2019-03-28 12:36:41,897 INFO L216 LassoAnalysis]: Preferences: 358.21/292.49 [2019-03-28 12:36:41,898 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 358.21/292.49 [2019-03-28 12:36:41,898 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 358.21/292.49 [2019-03-28 12:36:41,898 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 358.21/292.49 [2019-03-28 12:36:41,898 INFO L127 ssoRankerPreferences]: Use exernal solver: false 358.21/292.49 [2019-03-28 12:36:41,898 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 358.21/292.49 [2019-03-28 12:36:41,898 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 358.21/292.49 [2019-03-28 12:36:41,898 INFO L130 ssoRankerPreferences]: Path of dumped script: 358.21/292.49 [2019-03-28 12:36:41,898 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso 358.21/292.49 [2019-03-28 12:36:41,899 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 358.21/292.49 [2019-03-28 12:36:41,899 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 358.21/292.49 [2019-03-28 12:36:41,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:41,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:42,084 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 358.21/292.49 [2019-03-28 12:36:42,191 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 358.21/292.49 [2019-03-28 12:36:42,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:42,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:42,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:42,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:42,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:42,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:42,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:42,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:42,515 INFO L300 LassoAnalysis]: Preprocessing complete. 358.21/292.49 [2019-03-28 12:36:42,515 INFO L497 LassoAnalysis]: Using template 'affine'. 358.21/292.49 [2019-03-28 12:36:42,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:42,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:42,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:36:42,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:42,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:42,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:42,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:42,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:42,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:42,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:42,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:42,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:42,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:42,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:42,520 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:42,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:42,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:42,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:42,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:42,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:42,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:42,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:42,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:42,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:42,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:42,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:42,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:42,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:36:42,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:42,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:42,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:42,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:42,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:42,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:42,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:42,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:42,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:42,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:42,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:42,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:42,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:42,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:42,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:42,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:42,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:36:42,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:42,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:42,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:42,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:42,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:42,545 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 358.21/292.49 [2019-03-28 12:36:42,547 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 358.21/292.49 [2019-03-28 12:36:42,547 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. 358.21/292.49 [2019-03-28 12:36:42,548 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 358.21/292.49 [2019-03-28 12:36:42,548 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 358.21/292.49 [2019-03-28 12:36:42,548 INFO L518 LassoAnalysis]: Proved termination. 358.21/292.49 [2019-03-28 12:36:42,548 INFO L520 LassoAnalysis]: Termination argument consisting of: 358.21/292.49 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_7) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_7 358.21/292.49 Supporting invariants [] 358.21/292.49 [2019-03-28 12:36:42,605 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed 358.21/292.49 [2019-03-28 12:36:42,606 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 358.21/292.49 [2019-03-28 12:36:42,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.49 [2019-03-28 12:36:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.49 [2019-03-28 12:36:42,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core 358.21/292.49 [2019-03-28 12:36:42,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.49 [2019-03-28 12:36:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.49 [2019-03-28 12:36:42,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 358.21/292.49 [2019-03-28 12:36:42,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.49 [2019-03-28 12:36:42,650 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:36:42,651 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 358.21/292.49 [2019-03-28 12:36:42,652 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:42,670 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size 358.21/292.49 [2019-03-28 12:36:42,670 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:42,671 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 358.21/292.49 [2019-03-28 12:36:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 358.21/292.49 [2019-03-28 12:36:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.49 [2019-03-28 12:36:42,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 358.21/292.49 [2019-03-28 12:36:42,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.49 [2019-03-28 12:36:42,972 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:36:42,973 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 358.21/292.49 [2019-03-28 12:36:42,974 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:42,995 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size 358.21/292.49 [2019-03-28 12:36:42,995 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:42,995 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 358.21/292.49 [2019-03-28 12:36:43,029 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:36:43,030 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 71 358.21/292.49 [2019-03-28 12:36:43,031 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:43,066 INFO L497 ElimStorePlain]: treesize reduction 26, result has 55.9 percent of original size 358.21/292.49 [2019-03-28 12:36:43,067 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. 358.21/292.49 [2019-03-28 12:36:43,067 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 358.21/292.49 [2019-03-28 12:36:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:43,244 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:36:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:43,265 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:36:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:43,275 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:36:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:43,283 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:36:43,283 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 14 predicates after loop cannibalization 358.21/292.49 [2019-03-28 12:36:43,284 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 14 loop predicates 358.21/292.49 [2019-03-28 12:36:43,284 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16 Second operand 8 states. 358.21/292.49 [2019-03-28 12:36:45,622 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 96 states and 116 transitions. Complement of second has 31 states. 358.21/292.49 [2019-03-28 12:36:45,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 14 non-accepting loop states 2 accepting loop states 358.21/292.49 [2019-03-28 12:36:45,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 358.21/292.49 [2019-03-28 12:36:45,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 52 transitions. 358.21/292.49 [2019-03-28 12:36:45,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 8 letters. 358.21/292.49 [2019-03-28 12:36:45,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.49 [2019-03-28 12:36:45,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 10 letters. Loop has 8 letters. 358.21/292.49 [2019-03-28 12:36:45,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.49 [2019-03-28 12:36:45,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 16 letters. 358.21/292.49 [2019-03-28 12:36:45,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.49 [2019-03-28 12:36:45,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 116 transitions. 358.21/292.49 [2019-03-28 12:36:45,629 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 358.21/292.49 [2019-03-28 12:36:45,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 94 states and 113 transitions. 358.21/292.49 [2019-03-28 12:36:45,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 358.21/292.49 [2019-03-28 12:36:45,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 358.21/292.49 [2019-03-28 12:36:45,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 113 transitions. 358.21/292.49 [2019-03-28 12:36:45,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 358.21/292.49 [2019-03-28 12:36:45,631 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 113 transitions. 358.21/292.49 [2019-03-28 12:36:45,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 113 transitions. 358.21/292.49 [2019-03-28 12:36:45,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 42. 358.21/292.49 [2019-03-28 12:36:45,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 358.21/292.49 [2019-03-28 12:36:45,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. 358.21/292.49 [2019-03-28 12:36:45,634 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. 358.21/292.49 [2019-03-28 12:36:45,634 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. 358.21/292.49 [2019-03-28 12:36:45,634 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 358.21/292.49 [2019-03-28 12:36:45,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. 358.21/292.49 [2019-03-28 12:36:45,635 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 358.21/292.49 [2019-03-28 12:36:45,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 358.21/292.49 [2019-03-28 12:36:45,635 INFO L119 BuchiIsEmpty]: Starting construction of run 358.21/292.49 [2019-03-28 12:36:45,636 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 358.21/292.49 [2019-03-28 12:36:45,636 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 358.21/292.49 [2019-03-28 12:36:45,636 INFO L794 eck$LassoCheckResult]: Stem: 2743#ULTIMATE.startENTRY [99] 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] 2732#L-1 [128] L-1-->L7-4: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 2733#L7-4 358.21/292.49 [2019-03-28 12:36:45,636 INFO L796 eck$LassoCheckResult]: Loop: 2733#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 2765#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 2763#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 2764#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 2770#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 2768#L9-1 [116] L9-1-->L9-4: Formula: (> |v_ULTIMATE.start_main_#t~mem5_4| |v_ULTIMATE.start_main_#t~mem6_4|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 2767#L9-4 [62] L9-4-->L12: Formula: (and (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_10)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 2766#L12 [169] L12-->L7-4: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem8_6| 1))) |v_#memory_int_15|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 2733#L7-4 358.21/292.49 [2019-03-28 12:36:45,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.49 [2019-03-28 12:36:45,637 INFO L82 PathProgramCache]: Analyzing trace with hash 4158, now seen corresponding path program 1 times 358.21/292.49 [2019-03-28 12:36:45,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.49 [2019-03-28 12:36:45,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.49 [2019-03-28 12:36:45,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:45,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:45,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:45,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.49 [2019-03-28 12:36:45,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1550084622, now seen corresponding path program 8 times 358.21/292.49 [2019-03-28 12:36:45,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.49 [2019-03-28 12:36:45,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.49 [2019-03-28 12:36:45,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:45,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:45,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:45,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.49 [2019-03-28 12:36:45,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1054480687, now seen corresponding path program 1 times 358.21/292.49 [2019-03-28 12:36:45,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.49 [2019-03-28 12:36:45,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.49 [2019-03-28 12:36:45,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:45,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:45,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:45,919 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 358.21/292.49 [2019-03-28 12:36:45,980 INFO L216 LassoAnalysis]: Preferences: 358.21/292.49 [2019-03-28 12:36:45,980 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 358.21/292.49 [2019-03-28 12:36:45,980 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 358.21/292.49 [2019-03-28 12:36:45,980 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 358.21/292.49 [2019-03-28 12:36:45,981 INFO L127 ssoRankerPreferences]: Use exernal solver: false 358.21/292.49 [2019-03-28 12:36:45,981 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 358.21/292.49 [2019-03-28 12:36:45,981 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 358.21/292.49 [2019-03-28 12:36:45,981 INFO L130 ssoRankerPreferences]: Path of dumped script: 358.21/292.49 [2019-03-28 12:36:45,981 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Lasso 358.21/292.49 [2019-03-28 12:36:45,981 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 358.21/292.49 [2019-03-28 12:36:45,981 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 358.21/292.49 [2019-03-28 12:36:45,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:45,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:45,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:45,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:45,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:45,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:45,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:45,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:45,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:45,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:46,183 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 358.21/292.49 [2019-03-28 12:36:46,588 INFO L300 LassoAnalysis]: Preprocessing complete. 358.21/292.49 [2019-03-28 12:36:46,588 INFO L497 LassoAnalysis]: Using template 'affine'. 358.21/292.49 [2019-03-28 12:36:46,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:46,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:46,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:36:46,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:46,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:46,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:46,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:46,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:46,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:46,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:46,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:46,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:36:46,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:46,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:46,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:46,592 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:46,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:46,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:46,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:46,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:46,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:46,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:46,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:46,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:46,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:46,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:46,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:46,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:46,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:36:46,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:46,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:46,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:46,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:46,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:46,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:46,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:46,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:46,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:36:46,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:46,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:46,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:46,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:46,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:46,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:46,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:46,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:46,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:46,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:46,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:46,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:46,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:46,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:46,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:46,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:46,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:36:46,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:46,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:46,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:46,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:46,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:46,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:46,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:46,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:46,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:36:46,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:46,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:46,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:46,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:46,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:46,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:46,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:46,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:46,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:36:46,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:46,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:46,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:46,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:46,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:46,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:46,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:46,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:46,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:46,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:46,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:46,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:46,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:46,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:46,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:46,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:46,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:46,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:46,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:46,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:46,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:46,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:46,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:46,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:46,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:46,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:46,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:46,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:46,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:46,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:46,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:46,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:46,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:46,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:46,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:46,621 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:46,622 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:46,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:46,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:46,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:46,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:46,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:46,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:46,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:46,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:46,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:46,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:46,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:46,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:46,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:46,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:46,630 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:46,630 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:46,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:46,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:46,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:46,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:36:46,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:46,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:46,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:46,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:46,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:46,636 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 358.21/292.49 [2019-03-28 12:36:46,638 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 358.21/292.49 [2019-03-28 12:36:46,639 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. 358.21/292.49 [2019-03-28 12:36:46,639 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 358.21/292.49 [2019-03-28 12:36:46,639 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 358.21/292.49 [2019-03-28 12:36:46,639 INFO L518 LassoAnalysis]: Proved termination. 358.21/292.49 [2019-03-28 12:36:46,639 INFO L520 LassoAnalysis]: Termination argument consisting of: 358.21/292.49 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_8) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_8 358.21/292.49 Supporting invariants [] 358.21/292.49 [2019-03-28 12:36:46,706 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed 358.21/292.49 [2019-03-28 12:36:46,708 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 358.21/292.49 [2019-03-28 12:36:46,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.49 [2019-03-28 12:36:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.49 [2019-03-28 12:36:46,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core 358.21/292.49 [2019-03-28 12:36:46,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.49 [2019-03-28 12:36:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.49 [2019-03-28 12:36:46,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 358.21/292.49 [2019-03-28 12:36:46,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.49 [2019-03-28 12:36:46,757 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:36:46,757 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 358.21/292.49 [2019-03-28 12:36:46,758 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:46,783 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size 358.21/292.49 [2019-03-28 12:36:46,784 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:46,784 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 358.21/292.49 [2019-03-28 12:36:46,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 358.21/292.49 [2019-03-28 12:36:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.49 [2019-03-28 12:36:47,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 358.21/292.49 [2019-03-28 12:36:47,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.49 [2019-03-28 12:36:47,164 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:36:47,165 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 358.21/292.49 [2019-03-28 12:36:47,166 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:47,190 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size 358.21/292.49 [2019-03-28 12:36:47,190 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:47,191 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 358.21/292.49 [2019-03-28 12:36:47,227 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:36:47,227 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 71 358.21/292.49 [2019-03-28 12:36:47,229 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:47,269 INFO L497 ElimStorePlain]: treesize reduction 26, result has 55.9 percent of original size 358.21/292.49 [2019-03-28 12:36:47,270 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. 358.21/292.49 [2019-03-28 12:36:47,270 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 358.21/292.49 [2019-03-28 12:36:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:47,427 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:36:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:47,436 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:36:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:47,444 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:36:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:47,452 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:36:47,452 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 14 predicates after loop cannibalization 358.21/292.49 [2019-03-28 12:36:47,452 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 14 loop predicates 358.21/292.49 [2019-03-28 12:36:47,453 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16 Second operand 8 states. 358.21/292.49 [2019-03-28 12:36:49,918 WARN L188 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 358.21/292.49 [2019-03-28 12:36:50,165 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 42 states and 55 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 86 states and 105 transitions. Complement of second has 31 states. 358.21/292.49 [2019-03-28 12:36:50,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 14 non-accepting loop states 2 accepting loop states 358.21/292.49 [2019-03-28 12:36:50,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 358.21/292.49 [2019-03-28 12:36:50,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 52 transitions. 358.21/292.49 [2019-03-28 12:36:50,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 8 letters. 358.21/292.49 [2019-03-28 12:36:50,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.49 [2019-03-28 12:36:50,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 10 letters. Loop has 8 letters. 358.21/292.49 [2019-03-28 12:36:50,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.49 [2019-03-28 12:36:50,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 2 letters. Loop has 16 letters. 358.21/292.49 [2019-03-28 12:36:50,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.49 [2019-03-28 12:36:50,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 105 transitions. 358.21/292.49 [2019-03-28 12:36:50,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 358.21/292.49 [2019-03-28 12:36:50,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 84 states and 102 transitions. 358.21/292.49 [2019-03-28 12:36:50,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 358.21/292.49 [2019-03-28 12:36:50,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 358.21/292.49 [2019-03-28 12:36:50,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 102 transitions. 358.21/292.49 [2019-03-28 12:36:50,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 358.21/292.49 [2019-03-28 12:36:50,175 INFO L706 BuchiCegarLoop]: Abstraction has 84 states and 102 transitions. 358.21/292.49 [2019-03-28 12:36:50,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 102 transitions. 358.21/292.49 [2019-03-28 12:36:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 32. 358.21/292.49 [2019-03-28 12:36:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 358.21/292.49 [2019-03-28 12:36:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. 358.21/292.49 [2019-03-28 12:36:50,177 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. 358.21/292.49 [2019-03-28 12:36:50,177 INFO L609 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. 358.21/292.49 [2019-03-28 12:36:50,177 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 358.21/292.49 [2019-03-28 12:36:50,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. 358.21/292.49 [2019-03-28 12:36:50,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 358.21/292.49 [2019-03-28 12:36:50,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 358.21/292.49 [2019-03-28 12:36:50,178 INFO L119 BuchiIsEmpty]: Starting construction of run 358.21/292.49 [2019-03-28 12:36:50,179 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 358.21/292.49 [2019-03-28 12:36:50,179 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 358.21/292.49 [2019-03-28 12:36:50,179 INFO L794 eck$LassoCheckResult]: Stem: 3111#ULTIMATE.startENTRY [99] 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] 3101#L-1 [127] L-1-->L7-4: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 3102#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 3112#L7-1 358.21/292.49 [2019-03-28 12:36:50,180 INFO L796 eck$LassoCheckResult]: Loop: 3112#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 3113#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 3116#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 3117#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 3122#L9-1 [73] L9-1-->L10: Formula: (<= |v_ULTIMATE.start_main_#t~mem5_6| |v_ULTIMATE.start_main_#t~mem6_6|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 3103#L10 [78] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~j~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~j~0.base_10) v_ULTIMATE.start_main_~j~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_8 4) (select |v_#length_15| v_ULTIMATE.start_main_~j~0.base_10)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_8)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 3104#L10-1 [168] L10-1-->L9-3: Formula: (and (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16) v_ULTIMATE.start_main_~j~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem7_6| 1))) |v_#memory_int_13|) (<= 0 v_ULTIMATE.start_main_~j~0.offset_12) (<= (+ v_ULTIMATE.start_main_~j~0.offset_12 4) (select |v_#length_23| v_ULTIMATE.start_main_~j~0.base_16)) (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~j~0.base_16))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 3125#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 3128#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 3127#L9-1 [116] L9-1-->L9-4: Formula: (> |v_ULTIMATE.start_main_#t~mem5_4| |v_ULTIMATE.start_main_#t~mem6_4|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 3107#L9-4 [62] L9-4-->L12: Formula: (and (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_10)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 3108#L12 [169] L12-->L7-4: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem8_6| 1))) |v_#memory_int_15|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 3120#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 3112#L7-1 358.21/292.49 [2019-03-28 12:36:50,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.49 [2019-03-28 12:36:50,180 INFO L82 PathProgramCache]: Analyzing trace with hash 128954, now seen corresponding path program 1 times 358.21/292.49 [2019-03-28 12:36:50,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.49 [2019-03-28 12:36:50,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.49 [2019-03-28 12:36:50,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:50,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:50,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:50,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.49 [2019-03-28 12:36:50,213 INFO L82 PathProgramCache]: Analyzing trace with hash -422344952, now seen corresponding path program 1 times 358.21/292.49 [2019-03-28 12:36:50,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.49 [2019-03-28 12:36:50,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.49 [2019-03-28 12:36:50,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:50,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:50,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:50,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.49 [2019-03-28 12:36:50,226 INFO L82 PathProgramCache]: Analyzing trace with hash -415128593, now seen corresponding path program 1 times 358.21/292.49 [2019-03-28 12:36:50,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.49 [2019-03-28 12:36:50,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.49 [2019-03-28 12:36:50,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:50,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:50,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:36:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:50,524 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 358.21/292.49 [2019-03-28 12:36:50,602 INFO L216 LassoAnalysis]: Preferences: 358.21/292.49 [2019-03-28 12:36:50,602 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 358.21/292.49 [2019-03-28 12:36:50,602 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 358.21/292.49 [2019-03-28 12:36:50,602 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 358.21/292.49 [2019-03-28 12:36:50,602 INFO L127 ssoRankerPreferences]: Use exernal solver: false 358.21/292.49 [2019-03-28 12:36:50,602 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 358.21/292.49 [2019-03-28 12:36:50,602 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 358.21/292.49 [2019-03-28 12:36:50,603 INFO L130 ssoRankerPreferences]: Path of dumped script: 358.21/292.49 [2019-03-28 12:36:50,603 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Lasso 358.21/292.49 [2019-03-28 12:36:50,603 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 358.21/292.49 [2019-03-28 12:36:50,603 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 358.21/292.49 [2019-03-28 12:36:50,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:50,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:50,824 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 358.21/292.49 [2019-03-28 12:36:50,947 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 358.21/292.49 [2019-03-28 12:36:50,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:50,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:50,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:50,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:50,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:50,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:50,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:36:51,374 INFO L300 LassoAnalysis]: Preprocessing complete. 358.21/292.49 [2019-03-28 12:36:51,375 INFO L497 LassoAnalysis]: Using template 'affine'. 358.21/292.49 [2019-03-28 12:36:51,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:51,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:51,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:36:51,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:51,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:51,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:51,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:51,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:51,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:51,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:51,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:51,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:51,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:51,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:51,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:51,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:51,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:51,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:51,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:51,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:51,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:51,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:51,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:51,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:51,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:51,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:51,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:51,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:51,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:51,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:51,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:51,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:51,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:51,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:51,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:51,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:51,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:51,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:51,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:51,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:51,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:51,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:51,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:51,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:51,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:51,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:51,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:51,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:51,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:36:51,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:36:51,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:36:51,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:36:51,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:36:51,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:36:51,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:36:51,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:36:51,416 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 358.21/292.49 [2019-03-28 12:36:51,421 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 358.21/292.49 [2019-03-28 12:36:51,421 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. 358.21/292.49 [2019-03-28 12:36:51,422 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 358.21/292.49 [2019-03-28 12:36:51,424 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 358.21/292.49 [2019-03-28 12:36:51,424 INFO L518 LassoAnalysis]: Proved termination. 358.21/292.49 [2019-03-28 12:36:51,424 INFO L520 LassoAnalysis]: Termination argument consisting of: 358.21/292.49 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_9) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_9 + 1 358.21/292.49 Supporting invariants [] 358.21/292.49 [2019-03-28 12:36:51,499 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed 358.21/292.49 [2019-03-28 12:36:51,500 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 358.21/292.49 [2019-03-28 12:36:51,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.49 [2019-03-28 12:36:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.49 [2019-03-28 12:36:51,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core 358.21/292.49 [2019-03-28 12:36:51,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.49 [2019-03-28 12:36:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.49 [2019-03-28 12:36:51,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core 358.21/292.49 [2019-03-28 12:36:51,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.49 [2019-03-28 12:36:51,567 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:36:51,567 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 46 358.21/292.49 [2019-03-28 12:36:51,569 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:51,598 INFO L497 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size 358.21/292.49 [2019-03-28 12:36:51,599 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:51,599 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:30 358.21/292.49 [2019-03-28 12:36:52,205 WARN L188 SmtUtils]: Spent 536.00 ms on a formula simplification that was a NOOP. DAG size: 29 358.21/292.49 [2019-03-28 12:36:52,239 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:36:52,239 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 68 358.21/292.49 [2019-03-28 12:36:52,242 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:52,248 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 41 treesize of output 29 358.21/292.49 [2019-03-28 12:36:52,248 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:52,314 INFO L497 ElimStorePlain]: treesize reduction 18, result has 80.4 percent of original size 358.21/292.49 [2019-03-28 12:36:52,316 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 358.21/292.49 [2019-03-28 12:36:52,316 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:64 358.21/292.49 [2019-03-28 12:36:52,754 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 36 358.21/292.49 [2019-03-28 12:36:53,598 WARN L188 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 358.21/292.49 [2019-03-28 12:36:53,989 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 45 358.21/292.49 [2019-03-28 12:36:54,103 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:36:54,103 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 1 case distinctions, treesize of input 56 treesize of output 39 358.21/292.49 [2019-03-28 12:36:54,104 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:54,110 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 0 case distinctions, treesize of input 56 treesize of output 39 358.21/292.49 [2019-03-28 12:36:54,111 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:54,137 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:36:54,138 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. 358.21/292.49 [2019-03-28 12:36:54,138 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:113, output treesize:75 358.21/292.49 [2019-03-28 12:36:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 358.21/292.49 [2019-03-28 12:36:56,181 WARN L188 SmtUtils]: Spent 1.98 s on a formula simplification that was a NOOP. DAG size: 21 358.21/292.49 [2019-03-28 12:36:56,556 WARN L860 $PredicateComparison]: unable to prove that (or (<= 1 (+ (* 2 (select (select |c_#memory_int| c_ULTIMATE.start_main_~i~0.base) c_ULTIMATE.start_main_~i~0.offset)) c_oldRank0)) (exists ((v_arrayElimCell_33 Int)) (<= 1 (+ c_oldRank0 (* 2 v_arrayElimCell_33))))) is different from true 358.21/292.49 [2019-03-28 12:36:57,158 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_35 Int)) (let ((.cse0 (and (= c_ULTIMATE.start_main_~i~0.base c_ULTIMATE.start_main_~j~0.base) (= c_ULTIMATE.start_main_~j~0.offset c_ULTIMATE.start_main_~i~0.offset)))) (and (or .cse0 (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~i~0.base) c_ULTIMATE.start_main_~i~0.offset) v_arrayElimCell_35)) (or (= 0 v_arrayElimCell_35) (not .cse0)) (<= 1 (+ (* 2 v_arrayElimCell_35) c_oldRank0))))) (exists ((v_arrayElimCell_33 Int)) (<= 1 (+ c_oldRank0 (* 2 v_arrayElimCell_33))))) is different from true 358.21/292.49 [2019-03-28 12:36:58,291 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~j~0.base Int) (ULTIMATE.start_main_~j~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int| ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset))) (and (<= |c_ULTIMATE.start_main_#t~mem5| .cse0) (<= .cse0 1) (not (= ULTIMATE.start_main_~j~0.offset c_ULTIMATE.start_main_~i~0.offset))))) (exists ((ULTIMATE.start_main_~j~0.base Int) (ULTIMATE.start_main_~j~0.offset Int)) (let ((.cse1 (select (select |c_#memory_int| ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset))) (and (<= |c_ULTIMATE.start_main_#t~mem5| .cse1) (not (= c_ULTIMATE.start_main_~i~0.base ULTIMATE.start_main_~j~0.base)) (<= .cse1 1)))) (exists ((v_arrayElimCell_33 Int)) (<= 1 (+ c_oldRank0 (* 2 v_arrayElimCell_33))))) is different from true 358.21/292.49 [2019-03-28 12:36:59,311 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~j~0.base Int) (ULTIMATE.start_main_~j~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int| ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset))) (and (<= |c_ULTIMATE.start_main_#t~mem5| .cse0) (not (= c_ULTIMATE.start_main_~i~0.base ULTIMATE.start_main_~j~0.base)) (<= .cse0 1)))) (exists ((v_arrayElimCell_33 Int)) (<= 1 (+ c_oldRank0 (* 2 v_arrayElimCell_33)))) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse1 (select (select |c_#memory_int| v_prenex_1) v_prenex_2))) (and (not (= v_prenex_2 c_ULTIMATE.start_main_~i~0.offset)) (<= |c_ULTIMATE.start_main_#t~mem5| .cse1) (<= .cse1 1))))) is different from true 358.21/292.49 [2019-03-28 12:36:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:59,490 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:36:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:59,503 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:36:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:59,515 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:36:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:59,527 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:36:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:59,540 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:36:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:59,551 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:36:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:59,562 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:36:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:36:59,574 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:36:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.49 [2019-03-28 12:36:59,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core 358.21/292.49 [2019-03-28 12:36:59,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.49 [2019-03-28 12:36:59,602 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:36:59,602 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 46 358.21/292.49 [2019-03-28 12:36:59,604 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:59,626 INFO L497 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size 358.21/292.49 [2019-03-28 12:36:59,627 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:59,627 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:30 358.21/292.49 [2019-03-28 12:36:59,716 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:36:59,716 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 68 358.21/292.49 [2019-03-28 12:36:59,719 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:59,728 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 41 treesize of output 29 358.21/292.49 [2019-03-28 12:36:59,728 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.21/292.49 [2019-03-28 12:36:59,792 INFO L497 ElimStorePlain]: treesize reduction 18, result has 80.4 percent of original size 358.21/292.49 [2019-03-28 12:36:59,794 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 358.21/292.49 [2019-03-28 12:36:59,794 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:64 358.21/292.49 [2019-03-28 12:36:59,999 INFO L98 LoopCannibalizer]: 19 predicates before loop cannibalization 19 predicates after loop cannibalization 358.21/292.49 [2019-03-28 12:37:00,000 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 19 loop predicates 358.21/292.49 [2019-03-28 12:37:00,000 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 32 states and 44 transitions. cyclomatic complexity: 14 Second operand 11 states. 358.21/292.49 [2019-03-28 12:37:00,284 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 358.21/292.49 [2019-03-28 12:37:00,450 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 358.21/292.49 [2019-03-28 12:37:00,925 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 358.21/292.49 [2019-03-28 12:37:01,089 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 358.21/292.49 [2019-03-28 12:37:01,639 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 32 states and 44 transitions. cyclomatic complexity: 14. Second operand 11 states. Result 105 states and 127 transitions. Complement of second has 41 states. 358.21/292.49 [2019-03-28 12:37:01,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 1 stem states 18 non-accepting loop states 1 accepting loop states 358.21/292.49 [2019-03-28 12:37:01,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 358.21/292.49 [2019-03-28 12:37:01,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 50 transitions. 358.21/292.49 [2019-03-28 12:37:01,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 50 transitions. Stem has 3 letters. Loop has 13 letters. 358.21/292.49 [2019-03-28 12:37:01,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.49 [2019-03-28 12:37:01,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 50 transitions. Stem has 16 letters. Loop has 13 letters. 358.21/292.49 [2019-03-28 12:37:01,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.49 [2019-03-28 12:37:01,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 50 transitions. Stem has 3 letters. Loop has 26 letters. 358.21/292.49 [2019-03-28 12:37:01,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.49 [2019-03-28 12:37:01,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 127 transitions. 358.21/292.49 [2019-03-28 12:37:01,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 358.21/292.49 [2019-03-28 12:37:01,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 78 states and 96 transitions. 358.21/292.49 [2019-03-28 12:37:01,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 358.21/292.49 [2019-03-28 12:37:01,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 358.21/292.49 [2019-03-28 12:37:01,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 96 transitions. 358.21/292.49 [2019-03-28 12:37:01,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 358.21/292.49 [2019-03-28 12:37:01,661 INFO L706 BuchiCegarLoop]: Abstraction has 78 states and 96 transitions. 358.21/292.49 [2019-03-28 12:37:01,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 96 transitions. 358.21/292.49 [2019-03-28 12:37:01,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 60. 358.21/292.49 [2019-03-28 12:37:01,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. 358.21/292.49 [2019-03-28 12:37:01,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 77 transitions. 358.21/292.49 [2019-03-28 12:37:01,664 INFO L729 BuchiCegarLoop]: Abstraction has 60 states and 77 transitions. 358.21/292.49 [2019-03-28 12:37:01,664 INFO L609 BuchiCegarLoop]: Abstraction has 60 states and 77 transitions. 358.21/292.49 [2019-03-28 12:37:01,664 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ 358.21/292.49 [2019-03-28 12:37:01,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 77 transitions. 358.21/292.49 [2019-03-28 12:37:01,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 358.21/292.49 [2019-03-28 12:37:01,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 358.21/292.49 [2019-03-28 12:37:01,665 INFO L119 BuchiIsEmpty]: Starting construction of run 358.21/292.49 [2019-03-28 12:37:01,665 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 358.21/292.49 [2019-03-28 12:37:01,665 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] 358.21/292.49 [2019-03-28 12:37:01,666 INFO L794 eck$LassoCheckResult]: Stem: 3539#ULTIMATE.startENTRY [99] 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] 3529#L-1 [127] L-1-->L7-4: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 3530#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 3563#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 3550#L8 358.21/292.49 [2019-03-28 12:37:01,667 INFO L796 eck$LassoCheckResult]: Loop: 3550#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 3540#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 3541#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 3562#L9-1 [73] L9-1-->L10: Formula: (<= |v_ULTIMATE.start_main_#t~mem5_6| |v_ULTIMATE.start_main_#t~mem6_6|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 3561#L10 [78] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~j~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~j~0.base_10) v_ULTIMATE.start_main_~j~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_8 4) (select |v_#length_15| v_ULTIMATE.start_main_~j~0.base_10)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_8)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 3555#L10-1 [168] L10-1-->L9-3: Formula: (and (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16) v_ULTIMATE.start_main_~j~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem7_6| 1))) |v_#memory_int_13|) (<= 0 v_ULTIMATE.start_main_~j~0.offset_12) (<= (+ v_ULTIMATE.start_main_~j~0.offset_12 4) (select |v_#length_23| v_ULTIMATE.start_main_~j~0.base_16)) (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~j~0.base_16))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 3556#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 3557#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 3552#L9-1 [73] L9-1-->L10: Formula: (<= |v_ULTIMATE.start_main_#t~mem5_6| |v_ULTIMATE.start_main_#t~mem6_6|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 3531#L10 [78] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~j~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~j~0.base_10) v_ULTIMATE.start_main_~j~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_8 4) (select |v_#length_15| v_ULTIMATE.start_main_~j~0.base_10)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_8)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 3532#L10-1 [168] L10-1-->L9-3: Formula: (and (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16) v_ULTIMATE.start_main_~j~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem7_6| 1))) |v_#memory_int_13|) (<= 0 v_ULTIMATE.start_main_~j~0.offset_12) (<= (+ v_ULTIMATE.start_main_~j~0.offset_12 4) (select |v_#length_23| v_ULTIMATE.start_main_~j~0.base_16)) (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~j~0.base_16))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 3560#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 3559#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 3558#L9-1 [116] L9-1-->L9-4: Formula: (> |v_ULTIMATE.start_main_#t~mem5_4| |v_ULTIMATE.start_main_#t~mem6_4|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 3535#L9-4 [62] L9-4-->L12: Formula: (and (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_10)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 3536#L12 [169] L12-->L7-4: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem8_6| 1))) |v_#memory_int_15|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 3548#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 3554#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 3550#L8 358.21/292.49 [2019-03-28 12:37:01,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.49 [2019-03-28 12:37:01,667 INFO L82 PathProgramCache]: Analyzing trace with hash 3997744, now seen corresponding path program 1 times 358.21/292.49 [2019-03-28 12:37:01,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.49 [2019-03-28 12:37:01,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.49 [2019-03-28 12:37:01,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:37:01,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:37:01,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:37:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:37:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:37:01,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.49 [2019-03-28 12:37:01,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1083134898, now seen corresponding path program 2 times 358.21/292.49 [2019-03-28 12:37:01,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.49 [2019-03-28 12:37:01,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.49 [2019-03-28 12:37:01,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:37:01,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:37:01,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:37:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:37:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:37:01,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.49 [2019-03-28 12:37:01,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1305757217, now seen corresponding path program 2 times 358.21/292.49 [2019-03-28 12:37:01,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.49 [2019-03-28 12:37:01,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.49 [2019-03-28 12:37:01,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:37:01,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:37:01,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.49 [2019-03-28 12:37:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:37:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:37:02,084 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 358.21/292.49 [2019-03-28 12:37:02,334 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 358.21/292.49 [2019-03-28 12:37:02,412 INFO L216 LassoAnalysis]: Preferences: 358.21/292.49 [2019-03-28 12:37:02,413 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 358.21/292.49 [2019-03-28 12:37:02,413 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 358.21/292.49 [2019-03-28 12:37:02,413 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 358.21/292.49 [2019-03-28 12:37:02,413 INFO L127 ssoRankerPreferences]: Use exernal solver: false 358.21/292.49 [2019-03-28 12:37:02,413 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 358.21/292.49 [2019-03-28 12:37:02,413 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 358.21/292.49 [2019-03-28 12:37:02,413 INFO L130 ssoRankerPreferences]: Path of dumped script: 358.21/292.49 [2019-03-28 12:37:02,413 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Lasso 358.21/292.49 [2019-03-28 12:37:02,414 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 358.21/292.49 [2019-03-28 12:37:02,414 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 358.21/292.49 [2019-03-28 12:37:02,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:37:02,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:37:02,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:37:02,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:37:02,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:37:02,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:37:02,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:37:02,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:37:02,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:37:02,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.49 [2019-03-28 12:37:02,632 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 358.21/292.49 [2019-03-28 12:37:02,745 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 358.21/292.49 [2019-03-28 12:37:03,057 INFO L300 LassoAnalysis]: Preprocessing complete. 358.21/292.49 [2019-03-28 12:37:03,057 INFO L497 LassoAnalysis]: Using template 'affine'. 358.21/292.49 [2019-03-28 12:37:03,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:37:03,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:37:03,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:37:03,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:37:03,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:37:03,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:37:03,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:37:03,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:37:03,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:37:03,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:37:03,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:37:03,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:37:03,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:37:03,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:37:03,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:37:03,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:37:03,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:37:03,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:37:03,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:37:03,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:37:03,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:37:03,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:37:03,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:37:03,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:37:03,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:37:03,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:37:03,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:37:03,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:37:03,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:37:03,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:37:03,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:37:03,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:37:03,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:37:03,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:37:03,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:37:03,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:37:03,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:37:03,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:37:03,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:37:03,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:37:03,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:37:03,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:37:03,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:37:03,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:37:03,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:37:03,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:37:03,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:37:03,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:37:03,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:37:03,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:37:03,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:37:03,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:37:03,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:37:03,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:37:03,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:37:03,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:37:03,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:37:03,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:37:03,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:37:03,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:37:03,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:37:03,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:37:03,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:37:03,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:37:03,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:37:03,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:37:03,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:37:03,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:37:03,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:37:03,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:37:03,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:37:03,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:37:03,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:37:03,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:37:03,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:37:03,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:37:03,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:37:03,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:37:03,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:37:03,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:37:03,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:37:03,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:37:03,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:37:03,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:37:03,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:37:03,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:37:03,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:37:03,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:37:03,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:37:03,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.21/292.49 [2019-03-28 12:37:03,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:37:03,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:37:03,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:37:03,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:37:03,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.21/292.49 [2019-03-28 12:37:03,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:37:03,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:37:03,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:37:03,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:37:03,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:37:03,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:37:03,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:37:03,083 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:37:03,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:37:03,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:37:03,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:37:03,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:37:03,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:37:03,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:37:03,093 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:37:03,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:37:03,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:37:03,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:37:03,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:37:03,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:37:03,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:37:03,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:37:03,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:37:03,098 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:37:03,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:37:03,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:37:03,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:37:03,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:37:03,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:37:03,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:37:03,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:37:03,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:37:03,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:37:03,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:37:03,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:37:03,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:37:03,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:37:03,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:37:03,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:37:03,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:37:03,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:37:03,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:37:03,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:37:03,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:37:03,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:37:03,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:37:03,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:37:03,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:37:03,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:37:03,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:37:03,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:37:03,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:37:03,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:37:03,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:37:03,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:37:03,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:37:03,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.49 [2019-03-28 12:37:03,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.49 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.49 Number of strict supporting invariants: 0 358.21/292.49 Number of non-strict supporting invariants: 1 358.21/292.49 Consider only non-deceasing supporting invariants: true 358.21/292.49 Simplify termination arguments: true 358.21/292.49 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.49 [2019-03-28 12:37:03,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.49 [2019-03-28 12:37:03,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.49 [2019-03-28 12:37:03,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.49 [2019-03-28 12:37:03,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.49 [2019-03-28 12:37:03,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.49 [2019-03-28 12:37:03,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.49 [2019-03-28 12:37:03,131 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 358.21/292.49 [2019-03-28 12:37:03,137 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 358.21/292.49 [2019-03-28 12:37:03,137 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. 358.21/292.49 [2019-03-28 12:37:03,137 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 358.21/292.49 [2019-03-28 12:37:03,138 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 358.21/292.49 [2019-03-28 12:37:03,138 INFO L518 LassoAnalysis]: Proved termination. 358.21/292.49 [2019-03-28 12:37:03,139 INFO L520 LassoAnalysis]: Termination argument consisting of: 358.21/292.49 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_10) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_10 + 3 358.21/292.49 Supporting invariants [] 358.21/292.49 [2019-03-28 12:37:03,214 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed 358.21/292.49 [2019-03-28 12:37:03,215 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 358.21/292.49 [2019-03-28 12:37:03,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.49 [2019-03-28 12:37:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.49 [2019-03-28 12:37:03,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core 358.21/292.49 [2019-03-28 12:37:03,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.49 [2019-03-28 12:37:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.49 [2019-03-28 12:37:03,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjunts are in the unsatisfiable core 358.21/292.49 [2019-03-28 12:37:03,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.49 [2019-03-28 12:37:03,280 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:37:03,280 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 46 358.21/292.49 [2019-03-28 12:37:03,282 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.21/292.49 [2019-03-28 12:37:03,308 INFO L497 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size 358.21/292.49 [2019-03-28 12:37:03,309 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.21/292.49 [2019-03-28 12:37:03,309 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:30 358.21/292.49 [2019-03-28 12:37:03,733 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 29 358.21/292.49 [2019-03-28 12:37:03,743 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 41 treesize of output 29 358.21/292.49 [2019-03-28 12:37:03,744 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.49 [2019-03-28 12:37:03,768 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:37:03,769 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 68 358.21/292.49 [2019-03-28 12:37:03,771 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.21/292.49 [2019-03-28 12:37:03,835 INFO L497 ElimStorePlain]: treesize reduction 18, result has 80.4 percent of original size 358.21/292.49 [2019-03-28 12:37:03,837 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 358.21/292.49 [2019-03-28 12:37:03,837 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:64 358.21/292.49 [2019-03-28 12:37:04,289 WARN L188 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 37 358.21/292.49 [2019-03-28 12:37:05,103 WARN L188 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 358.21/292.49 [2019-03-28 12:37:05,137 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:37:05,138 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 68 358.21/292.49 [2019-03-28 12:37:05,141 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 358.21/292.49 [2019-03-28 12:37:05,147 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 41 treesize of output 29 358.21/292.49 [2019-03-28 12:37:05,147 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.21/292.49 [2019-03-28 12:37:05,214 INFO L497 ElimStorePlain]: treesize reduction 18, result has 81.1 percent of original size 358.21/292.49 [2019-03-28 12:37:05,217 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. 358.21/292.49 [2019-03-28 12:37:05,217 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:69 358.21/292.49 [2019-03-28 12:37:05,762 WARN L188 SmtUtils]: Spent 526.00 ms on a formula simplification that was a NOOP. DAG size: 39 358.21/292.49 [2019-03-28 12:37:06,973 WARN L188 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 54 DAG size of output: 37 358.21/292.49 [2019-03-28 12:37:07,418 WARN L188 SmtUtils]: Spent 420.00 ms on a formula simplification that was a NOOP. DAG size: 45 358.21/292.49 [2019-03-28 12:37:07,531 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 0 case distinctions, treesize of input 56 treesize of output 39 358.21/292.49 [2019-03-28 12:37:07,532 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.21/292.49 [2019-03-28 12:37:07,537 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:37:07,537 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 1 case distinctions, treesize of input 56 treesize of output 39 358.21/292.49 [2019-03-28 12:37:07,538 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.21/292.49 [2019-03-28 12:37:07,563 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:37:07,564 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. 358.21/292.49 [2019-03-28 12:37:07,565 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:113, output treesize:75 358.21/292.49 [2019-03-28 12:37:07,660 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 358.21/292.49 [2019-03-28 12:37:09,620 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_45 Int)) (and (or (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~i~0.base) c_ULTIMATE.start_main_~i~0.offset) v_arrayElimCell_45) (and (= c_ULTIMATE.start_main_~i~0.base c_ULTIMATE.start_main_~j~0.base) (= c_ULTIMATE.start_main_~j~0.offset c_ULTIMATE.start_main_~i~0.offset))) (<= 3 (+ c_oldRank0 (* 2 v_arrayElimCell_45))))) is different from true 358.21/292.49 [2019-03-28 12:37:09,986 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_45 Int)) (<= 3 (+ c_oldRank0 (* 2 v_arrayElimCell_45)))) (<= 3 (+ (* 2 (select (select |c_#memory_int| c_ULTIMATE.start_main_~i~0.base) c_ULTIMATE.start_main_~i~0.offset)) c_oldRank0))) is different from true 358.21/292.49 [2019-03-28 12:37:10,547 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_45 Int)) (<= 3 (+ c_oldRank0 (* 2 v_arrayElimCell_45)))) (exists ((v_arrayElimCell_48 Int)) (let ((.cse0 (and (= c_ULTIMATE.start_main_~i~0.base c_ULTIMATE.start_main_~j~0.base) (= c_ULTIMATE.start_main_~j~0.offset c_ULTIMATE.start_main_~i~0.offset)))) (and (or (= 0 v_arrayElimCell_48) (not .cse0)) (<= 3 (+ c_oldRank0 (* 2 v_arrayElimCell_48))) (or .cse0 (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~i~0.base) c_ULTIMATE.start_main_~i~0.offset) v_arrayElimCell_48)))))) is different from true 358.21/292.49 [2019-03-28 12:37:11,406 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_50 Int) (v_arrayElimCell_49 Int)) (let ((.cse0 (and (= c_ULTIMATE.start_main_~i~0.base c_ULTIMATE.start_main_~j~0.base) (= c_ULTIMATE.start_main_~j~0.offset c_ULTIMATE.start_main_~i~0.offset)))) (and (or (= v_arrayElimCell_49 v_arrayElimCell_50) (not .cse0)) (or (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~i~0.base) c_ULTIMATE.start_main_~i~0.offset) v_arrayElimCell_50) .cse0) (<= v_arrayElimCell_49 1) (<= (select (select |c_#memory_int| c_ULTIMATE.start_main_~j~0.base) c_ULTIMATE.start_main_~j~0.offset) (+ v_arrayElimCell_49 1)) (<= 3 (+ (* 2 v_arrayElimCell_50) c_oldRank0))))) (exists ((v_arrayElimCell_45 Int)) (<= 3 (+ c_oldRank0 (* 2 v_arrayElimCell_45))))) is different from true 358.21/292.49 [2019-03-28 12:37:12,651 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_45 Int)) (<= 3 (+ c_oldRank0 (* 2 v_arrayElimCell_45)))) (exists ((ULTIMATE.start_main_~j~0.base Int) (ULTIMATE.start_main_~j~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int| ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset))) (and (<= |c_ULTIMATE.start_main_#t~mem5| .cse0) (<= .cse0 2) (not (= c_ULTIMATE.start_main_~i~0.base ULTIMATE.start_main_~j~0.base))))) (exists ((ULTIMATE.start_main_~j~0.base Int) (ULTIMATE.start_main_~j~0.offset Int)) (let ((.cse1 (select (select |c_#memory_int| ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset))) (and (<= |c_ULTIMATE.start_main_#t~mem5| .cse1) (<= .cse1 2) (not (= ULTIMATE.start_main_~j~0.offset c_ULTIMATE.start_main_~i~0.offset)))))) is different from true 358.21/292.49 [2019-03-28 12:37:13,780 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_45 Int)) (<= 3 (+ c_oldRank0 (* 2 v_arrayElimCell_45)))) (exists ((ULTIMATE.start_main_~j~0.base Int) (ULTIMATE.start_main_~j~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int| ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset))) (and (<= |c_ULTIMATE.start_main_#t~mem5| .cse0) (<= .cse0 2) (not (= c_ULTIMATE.start_main_~i~0.base ULTIMATE.start_main_~j~0.base))))) (exists ((v_prenex_7 Int) (v_prenex_8 Int)) (let ((.cse1 (select (select |c_#memory_int| v_prenex_7) v_prenex_8))) (and (not (= v_prenex_8 c_ULTIMATE.start_main_~i~0.offset)) (<= |c_ULTIMATE.start_main_#t~mem5| .cse1) (<= .cse1 2))))) is different from true 358.21/292.49 [2019-03-28 12:37:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:37:13,902 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:37:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:37:13,919 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:37:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:37:13,935 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:37:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:37:13,950 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:37:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:37:13,968 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:37:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:37:13,984 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:37:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:37:13,999 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:37:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:37:14,016 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:37:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:37:14,033 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:37:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:37:14,052 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:37:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.49 [2019-03-28 12:37:14,068 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.21/292.49 [2019-03-28 12:37:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.49 [2019-03-28 12:37:14,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjunts are in the unsatisfiable core 358.21/292.49 [2019-03-28 12:37:14,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.49 [2019-03-28 12:37:14,102 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:37:14,103 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 46 358.21/292.49 [2019-03-28 12:37:14,104 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.21/292.49 [2019-03-28 12:37:14,126 INFO L497 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size 358.21/292.49 [2019-03-28 12:37:14,127 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.21/292.49 [2019-03-28 12:37:14,127 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:30 358.21/292.49 [2019-03-28 12:37:14,197 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:37:14,198 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 68 358.21/292.49 [2019-03-28 12:37:14,200 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.21/292.49 [2019-03-28 12:37:14,205 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 41 treesize of output 29 358.21/292.49 [2019-03-28 12:37:14,205 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.21/292.49 [2019-03-28 12:37:14,270 INFO L497 ElimStorePlain]: treesize reduction 18, result has 80.4 percent of original size 358.21/292.49 [2019-03-28 12:37:14,272 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 358.21/292.49 [2019-03-28 12:37:14,272 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:64 358.21/292.49 [2019-03-28 12:37:14,374 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:37:14,374 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 68 358.21/292.49 [2019-03-28 12:37:14,378 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 358.21/292.49 [2019-03-28 12:37:14,383 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 41 treesize of output 29 358.21/292.49 [2019-03-28 12:37:14,383 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.21/292.49 [2019-03-28 12:37:14,449 INFO L497 ElimStorePlain]: treesize reduction 18, result has 81.1 percent of original size 358.21/292.49 [2019-03-28 12:37:14,452 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. 358.21/292.49 [2019-03-28 12:37:14,452 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:69 358.21/292.49 [2019-03-28 12:37:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.21/292.49 [2019-03-28 12:37:14,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjunts are in the unsatisfiable core 358.21/292.49 [2019-03-28 12:37:14,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.21/292.49 [2019-03-28 12:37:14,806 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.49 [2019-03-28 12:37:14,806 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 46 358.21/292.49 [2019-03-28 12:37:14,807 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.21/292.49 [2019-03-28 12:37:14,830 INFO L497 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size 358.21/292.49 [2019-03-28 12:37:14,831 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.21/292.49 [2019-03-28 12:37:14,831 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:30 358.21/292.49 [2019-03-28 12:37:15,241 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 29 358.21/292.49 [2019-03-28 12:37:15,244 INFO L388 ElimStorePlain]: Different consts {2=[|v_#memory_int_274|], 6=[v_prenex_13]} 358.21/292.49 [2019-03-28 12:37:15,249 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 38 treesize of output 26 358.21/292.50 [2019-03-28 12:37:15,249 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.21/292.50 [2019-03-28 12:37:15,267 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.50 [2019-03-28 12:37:15,296 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.50 [2019-03-28 12:37:15,296 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 65 358.21/292.50 [2019-03-28 12:37:15,298 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.21/292.50 [2019-03-28 12:37:15,369 INFO L497 ElimStorePlain]: treesize reduction 16, result has 80.0 percent of original size 358.21/292.50 [2019-03-28 12:37:15,371 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 358.21/292.50 [2019-03-28 12:37:15,371 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:64 358.21/292.50 [2019-03-28 12:37:15,997 WARN L188 SmtUtils]: Spent 589.00 ms on a formula simplification that was a NOOP. DAG size: 37 358.21/292.50 [2019-03-28 12:37:16,800 WARN L188 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 358.21/292.50 [2019-03-28 12:37:17,257 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 31 358.21/292.50 [2019-03-28 12:37:18,015 WARN L188 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 358.21/292.50 [2019-03-28 12:37:18,419 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 30 358.21/292.50 [2019-03-28 12:37:18,454 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.50 [2019-03-28 12:37:18,454 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 71 358.21/292.50 [2019-03-28 12:37:18,457 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.21/292.50 [2019-03-28 12:37:18,463 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 41 treesize of output 29 358.21/292.50 [2019-03-28 12:37:18,464 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.21/292.50 [2019-03-28 12:37:18,540 INFO L497 ElimStorePlain]: treesize reduction 18, result has 81.1 percent of original size 358.21/292.50 [2019-03-28 12:37:18,541 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 358.21/292.50 [2019-03-28 12:37:18,542 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:67 358.21/292.50 [2019-03-28 12:37:19,210 WARN L188 SmtUtils]: Spent 617.00 ms on a formula simplification that was a NOOP. DAG size: 37 358.21/292.50 [2019-03-28 12:37:20,303 WARN L188 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 45 DAG size of output: 39 358.21/292.50 [2019-03-28 12:37:20,802 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification that was a NOOP. DAG size: 47 358.21/292.50 [2019-03-28 12:37:20,992 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.50 [2019-03-28 12:37:20,993 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 1 case distinctions, treesize of input 63 treesize of output 42 358.21/292.50 [2019-03-28 12:37:20,994 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.21/292.50 [2019-03-28 12:37:20,999 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 0 case distinctions, treesize of input 63 treesize of output 42 358.21/292.50 [2019-03-28 12:37:21,000 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.21/292.50 [2019-03-28 12:37:21,029 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 358.21/292.50 [2019-03-28 12:37:21,030 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. 358.21/292.50 [2019-03-28 12:37:21,030 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:127, output treesize:81 358.21/292.50 [2019-03-28 12:37:21,801 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_45 Int)) (<= 3 (+ c_oldRank0 (* 2 v_arrayElimCell_45)))) (exists ((v_arrayElimCell_66 Int)) (let ((.cse0 (and (= c_ULTIMATE.start_main_~i~0.base c_ULTIMATE.start_main_~j~0.base) (= c_ULTIMATE.start_main_~j~0.offset c_ULTIMATE.start_main_~i~0.offset)))) (and (<= 3 (+ c_oldRank0 (* 2 v_arrayElimCell_66))) (or .cse0 (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~i~0.base) c_ULTIMATE.start_main_~i~0.offset) v_arrayElimCell_66)) (or (not .cse0) (= 0 v_arrayElimCell_66)))))) is different from true 358.21/292.50 [2019-03-28 12:37:22,308 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_45 Int)) (<= 3 (+ c_oldRank0 (* 2 v_arrayElimCell_45)))) (<= (select (select |c_#memory_int| c_ULTIMATE.start_main_~j~0.base) c_ULTIMATE.start_main_~j~0.offset) (select (select |c_#memory_int| c_ULTIMATE.start_main_~i~0.base) c_ULTIMATE.start_main_~i~0.offset))) is different from true 358.21/292.50 [2019-03-28 12:37:22,949 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_45 Int)) (<= 3 (+ c_oldRank0 (* 2 v_arrayElimCell_45)))) (exists ((v_arrayElimCell_68 Int)) (let ((.cse0 (and (= c_ULTIMATE.start_main_~i~0.base c_ULTIMATE.start_main_~j~0.base) (= c_ULTIMATE.start_main_~j~0.offset c_ULTIMATE.start_main_~i~0.offset)))) (and (<= 3 (+ (* 2 v_arrayElimCell_68) c_oldRank0)) (<= 1 v_arrayElimCell_68) (or (= 1 v_arrayElimCell_68) (not .cse0)) (or .cse0 (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~i~0.base) c_ULTIMATE.start_main_~i~0.offset) v_arrayElimCell_68)))))) is different from true 358.21/292.50 [2019-03-28 12:37:23,502 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_45 Int)) (<= 3 (+ c_oldRank0 (* 2 v_arrayElimCell_45)))) (<= 1 (select (select |c_#memory_int| c_ULTIMATE.start_main_~i~0.base) c_ULTIMATE.start_main_~i~0.offset))) is different from true 358.21/292.50 [2019-03-28 12:37:24,649 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_45 Int)) (<= 3 (+ c_oldRank0 (* 2 v_arrayElimCell_45)))) (exists ((v_prenex_15 Int) (v_prenex_14 Int)) (let ((.cse0 (select (select |c_#memory_int| v_prenex_14) v_prenex_15))) (and (not (= c_ULTIMATE.start_main_~i~0.base v_prenex_14)) (<= .cse0 2) (<= |c_ULTIMATE.start_main_#t~mem5| .cse0)))) (exists ((ULTIMATE.start_main_~j~0.base Int) (ULTIMATE.start_main_~j~0.offset Int)) (let ((.cse1 (select (select |c_#memory_int| ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset))) (and (<= |c_ULTIMATE.start_main_#t~mem5| .cse1) (<= .cse1 2) (not (= ULTIMATE.start_main_~j~0.offset c_ULTIMATE.start_main_~i~0.offset)))))) is different from true 358.21/292.50 [2019-03-28 12:37:24,808 INFO L98 LoopCannibalizer]: 23 predicates before loop cannibalization 40 predicates after loop cannibalization 358.21/292.50 [2019-03-28 12:37:24,808 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 40 loop predicates 358.21/292.50 [2019-03-28 12:37:24,808 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 60 states and 77 transitions. cyclomatic complexity: 20 Second operand 12 states. 358.21/292.50 [2019-03-28 12:37:29,564 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 37 358.21/292.50 [2019-03-28 12:37:32,848 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 358.21/292.50 [2019-03-28 12:37:43,593 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 358.21/292.50 [2019-03-28 12:37:47,006 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 358.21/292.50 [2019-03-28 12:37:57,571 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 358.21/292.50 [2019-03-28 12:38:00,815 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 358.21/292.50 [2019-03-28 12:38:11,329 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 49 358.21/292.50 [2019-03-28 12:38:15,512 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 358.21/292.50 [2019-03-28 12:38:24,456 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 358.21/292.50 [2019-03-28 12:38:29,801 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 358.21/292.50 [2019-03-28 12:38:30,414 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 36 358.21/292.50 [2019-03-28 12:38:31,037 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 39 358.21/292.50 [2019-03-28 12:38:31,831 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 35 358.21/292.50 [2019-03-28 12:38:32,185 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 38 358.21/292.50 [2019-03-28 12:38:32,958 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 34 358.21/292.50 [2019-03-28 12:38:33,315 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 37 358.21/292.50 [2019-03-28 12:38:34,309 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 60 states and 77 transitions. cyclomatic complexity: 20. Second operand 12 states. Result 695 states and 801 transitions. Complement of second has 215 states. 358.21/292.50 [2019-03-28 12:38:34,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 60 states 1 stem states 56 non-accepting loop states 3 accepting loop states 358.21/292.50 [2019-03-28 12:38:34,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 358.21/292.50 [2019-03-28 12:38:34,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 104 transitions. 358.21/292.50 [2019-03-28 12:38:34,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 104 transitions. Stem has 4 letters. Loop has 18 letters. 358.21/292.50 [2019-03-28 12:38:34,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.50 [2019-03-28 12:38:34,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 104 transitions. Stem has 22 letters. Loop has 18 letters. 358.21/292.50 [2019-03-28 12:38:34,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.50 [2019-03-28 12:38:34,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 104 transitions. Stem has 4 letters. Loop has 36 letters. 358.21/292.50 [2019-03-28 12:38:34,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.21/292.50 [2019-03-28 12:38:34,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 695 states and 801 transitions. 358.21/292.50 [2019-03-28 12:38:34,325 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 358.21/292.50 [2019-03-28 12:38:34,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 695 states to 332 states and 384 transitions. 358.21/292.50 [2019-03-28 12:38:34,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 358.21/292.50 [2019-03-28 12:38:34,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 358.21/292.50 [2019-03-28 12:38:34,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 332 states and 384 transitions. 358.21/292.50 [2019-03-28 12:38:34,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 358.21/292.50 [2019-03-28 12:38:34,328 INFO L706 BuchiCegarLoop]: Abstraction has 332 states and 384 transitions. 358.21/292.50 [2019-03-28 12:38:34,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states and 384 transitions. 358.21/292.50 [2019-03-28 12:38:34,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 114. 358.21/292.50 [2019-03-28 12:38:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. 358.21/292.50 [2019-03-28 12:38:34,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 141 transitions. 358.21/292.50 [2019-03-28 12:38:34,334 INFO L729 BuchiCegarLoop]: Abstraction has 114 states and 141 transitions. 358.21/292.50 [2019-03-28 12:38:34,334 INFO L609 BuchiCegarLoop]: Abstraction has 114 states and 141 transitions. 358.21/292.50 [2019-03-28 12:38:34,334 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ 358.21/292.50 [2019-03-28 12:38:34,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 141 transitions. 358.21/292.50 [2019-03-28 12:38:34,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 358.21/292.50 [2019-03-28 12:38:34,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 358.21/292.50 [2019-03-28 12:38:34,335 INFO L119 BuchiIsEmpty]: Starting construction of run 358.21/292.50 [2019-03-28 12:38:34,336 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 358.21/292.50 [2019-03-28 12:38:34,336 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] 358.21/292.50 [2019-03-28 12:38:34,337 INFO L794 eck$LassoCheckResult]: Stem: 4966#ULTIMATE.startENTRY [99] 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] 4956#L-1 [127] L-1-->L7-4: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 4957#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 5018#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 5019#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 4970#L9-3 358.21/292.50 [2019-03-28 12:38:34,337 INFO L796 eck$LassoCheckResult]: Loop: 4970#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 4971#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 4977#L9-1 [73] L9-1-->L10: Formula: (<= |v_ULTIMATE.start_main_#t~mem5_6| |v_ULTIMATE.start_main_#t~mem6_6|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 4958#L10 [78] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~j~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~j~0.base_10) v_ULTIMATE.start_main_~j~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_8 4) (select |v_#length_15| v_ULTIMATE.start_main_~j~0.base_10)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_8)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 4959#L10-1 [168] L10-1-->L9-3: Formula: (and (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16) v_ULTIMATE.start_main_~j~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem7_6| 1))) |v_#memory_int_13|) (<= 0 v_ULTIMATE.start_main_~j~0.offset_12) (<= (+ v_ULTIMATE.start_main_~j~0.offset_12 4) (select |v_#length_23| v_ULTIMATE.start_main_~j~0.base_16)) (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~j~0.base_16))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 4984#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 4997#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 4996#L9-1 [73] L9-1-->L10: Formula: (<= |v_ULTIMATE.start_main_#t~mem5_6| |v_ULTIMATE.start_main_#t~mem6_6|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 4995#L10 [78] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~j~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~j~0.base_10) v_ULTIMATE.start_main_~j~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_8 4) (select |v_#length_15| v_ULTIMATE.start_main_~j~0.base_10)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_8)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 4994#L10-1 [168] L10-1-->L9-3: Formula: (and (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16) v_ULTIMATE.start_main_~j~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem7_6| 1))) |v_#memory_int_13|) (<= 0 v_ULTIMATE.start_main_~j~0.offset_12) (<= (+ v_ULTIMATE.start_main_~j~0.offset_12 4) (select |v_#length_23| v_ULTIMATE.start_main_~j~0.base_16)) (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~j~0.base_16))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 4993#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 4992#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 4991#L9-1 [73] L9-1-->L10: Formula: (<= |v_ULTIMATE.start_main_#t~mem5_6| |v_ULTIMATE.start_main_#t~mem6_6|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 4987#L10 [78] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~j~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~j~0.base_10) v_ULTIMATE.start_main_~j~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_8 4) (select |v_#length_15| v_ULTIMATE.start_main_~j~0.base_10)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_8)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 4990#L10-1 [168] L10-1-->L9-3: Formula: (and (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16) v_ULTIMATE.start_main_~j~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem7_6| 1))) |v_#memory_int_13|) (<= 0 v_ULTIMATE.start_main_~j~0.offset_12) (<= (+ v_ULTIMATE.start_main_~j~0.offset_12 4) (select |v_#length_23| v_ULTIMATE.start_main_~j~0.base_16)) (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~j~0.base_16))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 4989#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 4988#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 4986#L9-1 [116] L9-1-->L9-4: Formula: (> |v_ULTIMATE.start_main_#t~mem5_4| |v_ULTIMATE.start_main_#t~mem6_4|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 4962#L9-4 [62] L9-4-->L12: Formula: (and (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_10)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 4963#L12 [169] L12-->L7-4: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem8_6| 1))) |v_#memory_int_15|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 4974#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 4982#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 4980#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 4970#L9-3 358.21/292.50 [2019-03-28 12:38:34,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.50 [2019-03-28 12:38:34,338 INFO L82 PathProgramCache]: Analyzing trace with hash 123930156, now seen corresponding path program 1 times 358.21/292.50 [2019-03-28 12:38:34,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.50 [2019-03-28 12:38:34,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.50 [2019-03-28 12:38:34,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.50 [2019-03-28 12:38:34,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 358.21/292.50 [2019-03-28 12:38:34,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.50 [2019-03-28 12:38:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.50 [2019-03-28 12:38:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.50 [2019-03-28 12:38:34,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.50 [2019-03-28 12:38:34,349 INFO L82 PathProgramCache]: Analyzing trace with hash 21197804, now seen corresponding path program 3 times 358.21/292.50 [2019-03-28 12:38:34,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.50 [2019-03-28 12:38:34,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.50 [2019-03-28 12:38:34,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.50 [2019-03-28 12:38:34,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.21/292.50 [2019-03-28 12:38:34,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.50 [2019-03-28 12:38:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.50 [2019-03-28 12:38:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.50 [2019-03-28 12:38:34,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.21/292.50 [2019-03-28 12:38:34,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1206080159, now seen corresponding path program 3 times 358.21/292.50 [2019-03-28 12:38:34,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.21/292.50 [2019-03-28 12:38:34,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.21/292.50 [2019-03-28 12:38:34,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.50 [2019-03-28 12:38:34,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 358.21/292.50 [2019-03-28 12:38:34,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.21/292.50 [2019-03-28 12:38:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.50 [2019-03-28 12:38:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.21/292.50 [2019-03-28 12:38:34,806 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 105 358.21/292.50 [2019-03-28 12:38:35,128 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 358.21/292.50 [2019-03-28 12:38:35,231 INFO L216 LassoAnalysis]: Preferences: 358.21/292.50 [2019-03-28 12:38:35,232 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 358.21/292.50 [2019-03-28 12:38:35,232 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 358.21/292.50 [2019-03-28 12:38:35,232 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 358.21/292.50 [2019-03-28 12:38:35,232 INFO L127 ssoRankerPreferences]: Use exernal solver: false 358.21/292.50 [2019-03-28 12:38:35,232 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 358.21/292.50 [2019-03-28 12:38:35,232 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 358.21/292.50 [2019-03-28 12:38:35,232 INFO L130 ssoRankerPreferences]: Path of dumped script: 358.21/292.50 [2019-03-28 12:38:35,232 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Lasso 358.21/292.50 [2019-03-28 12:38:35,232 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 358.21/292.50 [2019-03-28 12:38:35,233 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 358.21/292.50 [2019-03-28 12:38:35,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.50 [2019-03-28 12:38:35,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.50 [2019-03-28 12:38:35,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.50 [2019-03-28 12:38:35,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.50 [2019-03-28 12:38:35,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.50 [2019-03-28 12:38:35,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.50 [2019-03-28 12:38:35,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.50 [2019-03-28 12:38:35,439 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 358.21/292.50 [2019-03-28 12:38:35,549 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 358.21/292.50 [2019-03-28 12:38:35,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.50 [2019-03-28 12:38:35,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.50 [2019-03-28 12:38:35,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.50 [2019-03-28 12:38:35,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.50 [2019-03-28 12:38:35,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.21/292.50 [2019-03-28 12:38:35,895 INFO L300 LassoAnalysis]: Preprocessing complete. 358.21/292.50 [2019-03-28 12:38:35,895 INFO L497 LassoAnalysis]: Using template 'affine'. 358.21/292.50 [2019-03-28 12:38:35,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.50 Number of strict supporting invariants: 0 358.21/292.50 Number of non-strict supporting invariants: 1 358.21/292.50 Consider only non-deceasing supporting invariants: true 358.21/292.50 Simplify termination arguments: true 358.21/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.50 [2019-03-28 12:38:35,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.50 [2019-03-28 12:38:35,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.50 [2019-03-28 12:38:35,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.50 [2019-03-28 12:38:35,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.50 [2019-03-28 12:38:35,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.50 [2019-03-28 12:38:35,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.50 [2019-03-28 12:38:35,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.50 [2019-03-28 12:38:35,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.50 Number of strict supporting invariants: 0 358.21/292.50 Number of non-strict supporting invariants: 1 358.21/292.50 Consider only non-deceasing supporting invariants: true 358.21/292.50 Simplify termination arguments: true 358.21/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.21/292.50 [2019-03-28 12:38:35,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.21/292.50 [2019-03-28 12:38:35,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.21/292.50 [2019-03-28 12:38:35,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.21/292.50 [2019-03-28 12:38:35,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.21/292.50 [2019-03-28 12:38:35,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.21/292.50 [2019-03-28 12:38:35,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.21/292.50 [2019-03-28 12:38:35,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.21/292.50 [2019-03-28 12:38:35,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.21/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.21/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:38:35,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:38:35,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.30/292.50 [2019-03-28 12:38:35,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:38:35,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:38:35,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:38:35,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:38:35,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.30/292.50 [2019-03-28 12:38:35,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.30/292.50 [2019-03-28 12:38:35,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:38:35,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:38:35,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:38:35,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:38:35,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:38:35,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:38:35,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.30/292.50 [2019-03-28 12:38:35,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.30/292.50 [2019-03-28 12:38:35,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:38:35,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:38:35,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.30/292.50 [2019-03-28 12:38:35,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:38:35,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:38:35,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:38:35,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:38:35,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.30/292.50 [2019-03-28 12:38:35,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.30/292.50 [2019-03-28 12:38:35,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:38:35,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:38:35,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.30/292.50 [2019-03-28 12:38:35,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:38:35,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:38:35,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:38:35,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:38:35,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.30/292.50 [2019-03-28 12:38:35,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.30/292.50 [2019-03-28 12:38:35,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:38:35,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:38:35,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:38:35,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:38:35,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:38:35,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:38:35,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.30/292.50 [2019-03-28 12:38:35,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.30/292.50 [2019-03-28 12:38:35,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:38:35,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:38:35,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:38:35,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:38:35,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:38:35,913 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:38:35,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.30/292.50 [2019-03-28 12:38:35,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.30/292.50 [2019-03-28 12:38:35,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:38:35,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:38:35,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:38:35,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:38:35,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:38:35,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:38:35,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.30/292.50 [2019-03-28 12:38:35,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.30/292.50 [2019-03-28 12:38:35,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:38:35,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:38:35,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:38:35,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:38:35,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:38:35,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:38:35,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.30/292.50 [2019-03-28 12:38:35,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.30/292.50 [2019-03-28 12:38:35,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:38:35,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:38:35,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:38:35,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:38:35,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:38:35,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:38:35,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.30/292.50 [2019-03-28 12:38:35,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.30/292.50 [2019-03-28 12:38:35,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:38:35,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:38:35,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:38:35,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:38:35,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:38:35,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:38:35,936 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.30/292.50 [2019-03-28 12:38:35,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.30/292.50 [2019-03-28 12:38:35,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:38:35,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:38:35,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:38:35,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:38:35,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:38:35,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:38:35,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.30/292.50 [2019-03-28 12:38:35,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.30/292.50 [2019-03-28 12:38:35,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:38:35,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:38:35,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:38:35,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:38:35,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:38:35,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:38:35,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.30/292.50 [2019-03-28 12:38:35,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.30/292.50 [2019-03-28 12:38:35,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:38:35,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:38:35,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:38:35,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:38:35,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:38:35,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:38:35,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.30/292.50 [2019-03-28 12:38:35,953 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 358.30/292.50 [2019-03-28 12:38:35,958 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 358.30/292.50 [2019-03-28 12:38:35,958 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. 358.30/292.50 [2019-03-28 12:38:35,959 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 358.30/292.50 [2019-03-28 12:38:35,959 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 358.30/292.50 [2019-03-28 12:38:35,959 INFO L518 LassoAnalysis]: Proved termination. 358.30/292.50 [2019-03-28 12:38:35,959 INFO L520 LassoAnalysis]: Termination argument consisting of: 358.30/292.50 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_11, v_rep(select (select #memory_int ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)_11) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_11 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)_11 358.30/292.50 Supporting invariants [] 358.30/292.50 [2019-03-28 12:38:36,087 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed 358.30/292.50 [2019-03-28 12:38:36,088 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 358.30/292.50 [2019-03-28 12:38:36,088 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 358.30/292.50 [2019-03-28 12:38:36,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.30/292.50 [2019-03-28 12:38:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.30/292.50 [2019-03-28 12:38:36,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core 358.30/292.50 [2019-03-28 12:38:36,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.30/292.50 [2019-03-28 12:38:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.30/292.50 [2019-03-28 12:38:36,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 20 conjunts are in the unsatisfiable core 358.30/292.50 [2019-03-28 12:38:36,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.30/292.50 [2019-03-28 12:38:36,252 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 358.30/292.50 [2019-03-28 12:38:36,253 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 108 358.30/292.50 [2019-03-28 12:38:36,279 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:36,380 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 358.30/292.50 [2019-03-28 12:38:36,380 INFO L497 ElimStorePlain]: treesize reduction 151, result has 31.1 percent of original size 358.30/292.50 [2019-03-28 12:38:36,381 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 358.30/292.50 [2019-03-28 12:38:36,381 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:64 358.30/292.50 [2019-03-28 12:38:36,513 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 31 treesize of output 23 358.30/292.50 [2019-03-28 12:38:36,513 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:36,521 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 31 treesize of output 23 358.30/292.50 [2019-03-28 12:38:36,522 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:36,566 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:36,566 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 86 358.30/292.50 [2019-03-28 12:38:36,571 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:36,580 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 36 treesize of output 28 358.30/292.50 [2019-03-28 12:38:36,580 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:36,609 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:36,609 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 71 358.30/292.50 [2019-03-28 12:38:36,612 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:36,649 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:36,649 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 86 358.30/292.50 [2019-03-28 12:38:36,654 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:36,882 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 358.30/292.50 [2019-03-28 12:38:36,882 INFO L497 ElimStorePlain]: treesize reduction 317, result has 28.9 percent of original size 358.30/292.50 [2019-03-28 12:38:36,883 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. 358.30/292.50 [2019-03-28 12:38:36,883 INFO L217 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:217, output treesize:88 358.30/292.50 [2019-03-28 12:38:37,213 INFO L189 IndexEqualityManager]: detected not equals via solver 358.30/292.50 [2019-03-28 12:38:37,216 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:37,216 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 358.30/292.50 [2019-03-28 12:38:37,216 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:37,230 INFO L189 IndexEqualityManager]: detected not equals via solver 358.30/292.50 [2019-03-28 12:38:37,258 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:37,259 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 86 358.30/292.50 [2019-03-28 12:38:37,262 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:37,276 INFO L189 IndexEqualityManager]: detected not equals via solver 358.30/292.50 [2019-03-28 12:38:37,304 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:37,305 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 358.30/292.50 [2019-03-28 12:38:37,308 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:37,323 INFO L189 IndexEqualityManager]: detected not equals via solver 358.30/292.50 [2019-03-28 12:38:37,407 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 358.30/292.50 [2019-03-28 12:38:37,408 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 110 358.30/292.50 [2019-03-28 12:38:37,410 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:37,419 INFO L189 IndexEqualityManager]: detected not equals via solver 358.30/292.50 [2019-03-28 12:38:37,440 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:37,440 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 38 treesize of output 67 358.30/292.50 [2019-03-28 12:38:37,442 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:37,448 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 0 case distinctions, treesize of input 39 treesize of output 30 358.30/292.50 [2019-03-28 12:38:37,448 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:37,673 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 38 358.30/292.50 [2019-03-28 12:38:37,673 INFO L497 ElimStorePlain]: treesize reduction 424, result has 27.8 percent of original size 358.30/292.50 [2019-03-28 12:38:37,674 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 6 xjuncts. 358.30/292.50 [2019-03-28 12:38:37,674 INFO L217 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:253, output treesize:163 358.30/292.50 [2019-03-28 12:38:38,177 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 358.30/292.50 [2019-03-28 12:38:38,178 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 358.30/292.50 [2019-03-28 12:38:38,178 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 118 358.30/292.50 [2019-03-28 12:38:38,211 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:38,250 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:38,250 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 74 358.30/292.50 [2019-03-28 12:38:38,253 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:38,374 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 40 358.30/292.50 [2019-03-28 12:38:38,374 INFO L497 ElimStorePlain]: treesize reduction 243, result has 30.6 percent of original size 358.30/292.50 [2019-03-28 12:38:38,375 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 358.30/292.50 [2019-03-28 12:38:38,375 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:91 358.30/292.50 [2019-03-28 12:38:38,578 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 358.30/292.50 [2019-03-28 12:38:39,913 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 358.30/292.50 [2019-03-28 12:38:40,197 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 358.30/292.50 [2019-03-28 12:38:40,238 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 358.30/292.50 [2019-03-28 12:38:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.30/292.50 [2019-03-28 12:38:40,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 20 conjunts are in the unsatisfiable core 358.30/292.50 [2019-03-28 12:38:40,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.30/292.50 [2019-03-28 12:38:41,078 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 358.30/292.50 [2019-03-28 12:38:41,078 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 108 358.30/292.50 [2019-03-28 12:38:41,101 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:41,253 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 358.30/292.50 [2019-03-28 12:38:41,254 INFO L497 ElimStorePlain]: treesize reduction 187, result has 28.6 percent of original size 358.30/292.50 [2019-03-28 12:38:41,254 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. 358.30/292.50 [2019-03-28 12:38:41,255 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:70 358.30/292.50 [2019-03-28 12:38:41,307 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 31 treesize of output 23 358.30/292.50 [2019-03-28 12:38:41,307 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:41,354 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:41,355 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 86 358.30/292.50 [2019-03-28 12:38:41,359 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:41,369 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 31 treesize of output 23 358.30/292.50 [2019-03-28 12:38:41,369 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:41,377 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 36 treesize of output 28 358.30/292.50 [2019-03-28 12:38:41,378 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:41,408 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:41,408 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 71 358.30/292.50 [2019-03-28 12:38:41,411 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:41,452 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:41,452 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 86 358.30/292.50 [2019-03-28 12:38:41,457 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:41,610 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 358.30/292.50 [2019-03-28 12:38:41,610 INFO L497 ElimStorePlain]: treesize reduction 317, result has 27.0 percent of original size 358.30/292.50 [2019-03-28 12:38:41,611 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. 358.30/292.50 [2019-03-28 12:38:41,611 INFO L217 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:217, output treesize:85 358.30/292.50 [2019-03-28 12:38:41,643 INFO L189 IndexEqualityManager]: detected not equals via solver 358.30/292.50 [2019-03-28 12:38:41,728 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 358.30/292.50 [2019-03-28 12:38:41,729 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 110 358.30/292.50 [2019-03-28 12:38:41,731 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:41,746 INFO L189 IndexEqualityManager]: detected not equals via solver 358.30/292.50 [2019-03-28 12:38:41,774 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:41,775 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 358.30/292.50 [2019-03-28 12:38:41,778 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:41,793 INFO L189 IndexEqualityManager]: detected not equals via solver 358.30/292.50 [2019-03-28 12:38:41,822 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:41,822 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 86 358.30/292.50 [2019-03-28 12:38:41,825 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:41,834 INFO L189 IndexEqualityManager]: detected not equals via solver 358.30/292.50 [2019-03-28 12:38:41,837 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 358.30/292.50 [2019-03-28 12:38:41,837 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:41,847 INFO L189 IndexEqualityManager]: detected not equals via solver 358.30/292.50 [2019-03-28 12:38:41,849 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:41,850 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 358.30/292.50 [2019-03-28 12:38:41,850 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:41,885 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:41,886 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 67 358.30/292.50 [2019-03-28 12:38:41,887 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:42,117 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 39 358.30/292.50 [2019-03-28 12:38:42,118 INFO L497 ElimStorePlain]: treesize reduction 443, result has 25.4 percent of original size 358.30/292.50 [2019-03-28 12:38:42,118 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 6 xjuncts. 358.30/292.50 [2019-03-28 12:38:42,118 INFO L217 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:253, output treesize:149 358.30/292.50 [2019-03-28 12:38:42,178 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:42,179 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 74 358.30/292.50 [2019-03-28 12:38:42,181 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:42,270 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 358.30/292.50 [2019-03-28 12:38:42,271 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 118 358.30/292.50 [2019-03-28 12:38:42,295 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:42,409 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 40 358.30/292.50 [2019-03-28 12:38:42,410 INFO L497 ElimStorePlain]: treesize reduction 235, result has 31.3 percent of original size 358.30/292.50 [2019-03-28 12:38:42,411 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 358.30/292.50 [2019-03-28 12:38:42,411 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:91 358.30/292.50 [2019-03-28 12:38:42,460 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:42,460 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 89 358.30/292.50 [2019-03-28 12:38:42,466 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:42,505 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:42,505 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 89 358.30/292.50 [2019-03-28 12:38:42,511 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:42,599 INFO L497 ElimStorePlain]: treesize reduction 151, result has 40.1 percent of original size 358.30/292.50 [2019-03-28 12:38:42,600 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. 358.30/292.50 [2019-03-28 12:38:42,600 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:111, output treesize:97 358.30/292.50 [2019-03-28 12:38:42,817 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 358.30/292.50 [2019-03-28 12:38:42,818 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 358.30/292.50 [2019-03-28 12:38:42,818 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 358.30/292.50 [2019-03-28 12:38:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.30/292.50 [2019-03-28 12:38:42,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core 358.30/292.50 [2019-03-28 12:38:43,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.30/292.50 [2019-03-28 12:38:43,039 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:43,040 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 93 358.30/292.50 [2019-03-28 12:38:43,045 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:43,103 INFO L497 ElimStorePlain]: treesize reduction 84, result has 39.1 percent of original size 358.30/292.50 [2019-03-28 12:38:43,104 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 358.30/292.50 [2019-03-28 12:38:43,104 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:44 358.30/292.50 [2019-03-28 12:38:43,506 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 358.30/292.50 [2019-03-28 12:38:43,507 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:43,560 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:43,561 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 93 358.30/292.50 [2019-03-28 12:38:43,564 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:43,570 INFO L189 IndexEqualityManager]: detected not equals via solver 358.30/292.50 [2019-03-28 12:38:43,570 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 358.30/292.50 [2019-03-28 12:38:43,570 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:43,575 INFO L189 IndexEqualityManager]: detected not equals via solver 358.30/292.50 [2019-03-28 12:38:43,575 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 358.30/292.50 [2019-03-28 12:38:43,575 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:43,580 INFO L189 IndexEqualityManager]: detected not equals via solver 358.30/292.50 [2019-03-28 12:38:43,580 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 358.30/292.50 [2019-03-28 12:38:43,581 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:43,645 INFO L497 ElimStorePlain]: treesize reduction 72, result has 46.7 percent of original size 358.30/292.50 [2019-03-28 12:38:43,646 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 358.30/292.50 [2019-03-28 12:38:43,646 INFO L217 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:124, output treesize:53 358.30/292.50 [2019-03-28 12:38:44,060 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 0 case distinctions, treesize of input 42 treesize of output 33 358.30/292.50 [2019-03-28 12:38:44,060 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:44,161 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 358.30/292.50 [2019-03-28 12:38:44,161 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 111 358.30/292.50 [2019-03-28 12:38:44,188 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:44,204 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:44,205 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 1 case distinctions, treesize of input 42 treesize of output 33 358.30/292.50 [2019-03-28 12:38:44,205 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:44,213 INFO L172 IndexEqualityManager]: detected equality via solver 358.30/292.50 [2019-03-28 12:38:44,217 INFO L189 IndexEqualityManager]: detected not equals via solver 358.30/292.50 [2019-03-28 12:38:44,217 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 1 358.30/292.50 [2019-03-28 12:38:44,218 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:44,225 INFO L189 IndexEqualityManager]: detected not equals via solver 358.30/292.50 [2019-03-28 12:38:44,226 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 1 358.30/292.50 [2019-03-28 12:38:44,226 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:44,388 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 358.30/292.50 [2019-03-28 12:38:44,389 INFO L497 ElimStorePlain]: treesize reduction 230, result has 35.6 percent of original size 358.30/292.50 [2019-03-28 12:38:44,389 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. 358.30/292.50 [2019-03-28 12:38:44,389 INFO L217 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:214, output treesize:121 358.30/292.50 [2019-03-28 12:38:44,816 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:44,816 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 74 358.30/292.50 [2019-03-28 12:38:44,819 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:44,909 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 358.30/292.50 [2019-03-28 12:38:44,909 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 118 358.30/292.50 [2019-03-28 12:38:44,929 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:45,044 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 358.30/292.50 [2019-03-28 12:38:45,045 INFO L497 ElimStorePlain]: treesize reduction 208, result has 32.5 percent of original size 358.30/292.50 [2019-03-28 12:38:45,045 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 358.30/292.50 [2019-03-28 12:38:45,045 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:85 358.30/292.50 [2019-03-28 12:38:45,125 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:45,125 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 89 358.30/292.50 [2019-03-28 12:38:45,131 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:45,165 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:45,166 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 89 358.30/292.50 [2019-03-28 12:38:45,171 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:45,261 INFO L497 ElimStorePlain]: treesize reduction 163, result has 38.3 percent of original size 358.30/292.50 [2019-03-28 12:38:45,262 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. 358.30/292.50 [2019-03-28 12:38:45,262 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:111, output treesize:97 358.30/292.50 [2019-03-28 12:38:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.30/292.50 [2019-03-28 12:38:50,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core 358.30/292.50 [2019-03-28 12:38:50,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.30/292.50 [2019-03-28 12:38:50,183 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:50,183 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 93 358.30/292.50 [2019-03-28 12:38:50,198 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:50,268 INFO L497 ElimStorePlain]: treesize reduction 48, result has 59.7 percent of original size 358.30/292.50 [2019-03-28 12:38:50,269 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 358.30/292.50 [2019-03-28 12:38:50,269 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:61 358.30/292.50 [2019-03-28 12:38:50,373 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:50,373 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 1 case distinctions, treesize of input 42 treesize of output 33 358.30/292.50 [2019-03-28 12:38:50,374 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:50,385 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 0 case distinctions, treesize of input 42 treesize of output 33 358.30/292.50 [2019-03-28 12:38:50,386 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:50,391 INFO L172 IndexEqualityManager]: detected equality via solver 358.30/292.50 [2019-03-28 12:38:50,394 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 23 358.30/292.50 [2019-03-28 12:38:50,395 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:50,399 INFO L172 IndexEqualityManager]: detected equality via solver 358.30/292.50 [2019-03-28 12:38:50,403 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 23 358.30/292.50 [2019-03-28 12:38:50,403 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:50,489 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 358.30/292.50 [2019-03-28 12:38:50,490 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 111 358.30/292.50 [2019-03-28 12:38:50,516 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:50,654 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 45 358.30/292.50 [2019-03-28 12:38:50,655 INFO L497 ElimStorePlain]: treesize reduction 268, result has 32.0 percent of original size 358.30/292.50 [2019-03-28 12:38:50,655 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. 358.30/292.50 [2019-03-28 12:38:50,656 INFO L217 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:214, output treesize:121 358.30/292.50 [2019-03-28 12:38:50,726 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:50,726 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 74 358.30/292.50 [2019-03-28 12:38:50,729 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:50,817 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 358.30/292.50 [2019-03-28 12:38:50,817 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 118 358.30/292.50 [2019-03-28 12:38:50,836 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:50,944 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 358.30/292.50 [2019-03-28 12:38:50,944 INFO L497 ElimStorePlain]: treesize reduction 199, result has 33.2 percent of original size 358.30/292.50 [2019-03-28 12:38:50,945 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 358.30/292.50 [2019-03-28 12:38:50,945 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:85 358.30/292.50 [2019-03-28 12:38:51,023 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:51,023 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 89 358.30/292.50 [2019-03-28 12:38:51,028 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:51,063 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:51,064 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 89 358.30/292.50 [2019-03-28 12:38:51,069 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:51,150 INFO L497 ElimStorePlain]: treesize reduction 156, result has 39.3 percent of original size 358.30/292.50 [2019-03-28 12:38:51,150 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 358.30/292.50 [2019-03-28 12:38:51,150 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:111, output treesize:97 358.30/292.50 [2019-03-28 12:38:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.30/292.50 [2019-03-28 12:38:52,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core 358.30/292.50 [2019-03-28 12:38:52,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.30/292.50 [2019-03-28 12:38:52,235 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:52,235 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 93 358.30/292.50 [2019-03-28 12:38:52,238 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:52,301 INFO L497 ElimStorePlain]: treesize reduction 51, result has 55.3 percent of original size 358.30/292.50 [2019-03-28 12:38:52,301 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 358.30/292.50 [2019-03-28 12:38:52,302 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:53 358.30/292.50 [2019-03-28 12:38:52,394 INFO L172 IndexEqualityManager]: detected equality via solver 358.30/292.50 [2019-03-28 12:38:52,399 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 23 358.30/292.50 [2019-03-28 12:38:52,399 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:52,411 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 0 case distinctions, treesize of input 42 treesize of output 33 358.30/292.50 [2019-03-28 12:38:52,411 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:52,425 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:52,425 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 1 case distinctions, treesize of input 42 treesize of output 33 358.30/292.50 [2019-03-28 12:38:52,426 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:52,430 INFO L172 IndexEqualityManager]: detected equality via solver 358.30/292.50 [2019-03-28 12:38:52,434 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 23 358.30/292.50 [2019-03-28 12:38:52,434 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:52,525 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 358.30/292.50 [2019-03-28 12:38:52,525 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 111 358.30/292.50 [2019-03-28 12:38:52,564 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:52,702 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 358.30/292.50 [2019-03-28 12:38:52,702 INFO L497 ElimStorePlain]: treesize reduction 245, result has 34.1 percent of original size 358.30/292.50 [2019-03-28 12:38:52,703 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. 358.30/292.50 [2019-03-28 12:38:52,703 INFO L217 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:214, output treesize:121 358.30/292.50 [2019-03-28 12:38:52,843 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 358.30/292.50 [2019-03-28 12:38:52,843 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 118 358.30/292.50 [2019-03-28 12:38:52,861 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:52,891 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:52,891 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 74 358.30/292.50 [2019-03-28 12:38:52,893 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:53,068 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 358.30/292.50 [2019-03-28 12:38:53,069 INFO L497 ElimStorePlain]: treesize reduction 166, result has 42.6 percent of original size 358.30/292.50 [2019-03-28 12:38:53,069 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 358.30/292.50 [2019-03-28 12:38:53,070 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:107 358.30/292.50 [2019-03-28 12:38:53,156 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:53,156 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 89 358.30/292.50 [2019-03-28 12:38:53,161 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:53,205 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:53,205 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 89 358.30/292.50 [2019-03-28 12:38:53,210 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:53,305 INFO L497 ElimStorePlain]: treesize reduction 163, result has 38.3 percent of original size 358.30/292.50 [2019-03-28 12:38:53,306 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 358.30/292.50 [2019-03-28 12:38:53,306 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:111, output treesize:97 358.30/292.50 [2019-03-28 12:38:53,609 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:53,609 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 59 358.30/292.50 [2019-03-28 12:38:53,610 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:53,638 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:53,639 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 59 358.30/292.50 [2019-03-28 12:38:53,639 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:53,666 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:53,666 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 59 358.30/292.50 [2019-03-28 12:38:53,667 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:53,685 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:53,686 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 59 358.30/292.50 [2019-03-28 12:38:53,686 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:53,793 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 358.30/292.50 [2019-03-28 12:38:53,793 INFO L497 ElimStorePlain]: treesize reduction 80, result has 69.8 percent of original size 358.30/292.50 [2019-03-28 12:38:53,794 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:53,794 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:229, output treesize:29 358.30/292.50 [2019-03-28 12:38:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.30/292.50 [2019-03-28 12:38:54,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core 358.30/292.50 [2019-03-28 12:38:54,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.30/292.50 [2019-03-28 12:38:54,519 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:54,520 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 93 358.30/292.50 [2019-03-28 12:38:54,524 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:54,585 INFO L497 ElimStorePlain]: treesize reduction 84, result has 39.1 percent of original size 358.30/292.50 [2019-03-28 12:38:54,586 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 358.30/292.50 [2019-03-28 12:38:54,586 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:44 358.30/292.50 [2019-03-28 12:38:54,595 INFO L172 IndexEqualityManager]: detected equality via solver 358.30/292.50 [2019-03-28 12:38:54,600 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 23 358.30/292.50 [2019-03-28 12:38:54,600 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:54,615 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:54,616 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 1 case distinctions, treesize of input 42 treesize of output 33 358.30/292.50 [2019-03-28 12:38:54,616 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:54,721 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 358.30/292.50 [2019-03-28 12:38:54,722 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 111 358.30/292.50 [2019-03-28 12:38:54,744 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:54,752 INFO L172 IndexEqualityManager]: detected equality via solver 358.30/292.50 [2019-03-28 12:38:54,755 INFO L189 IndexEqualityManager]: detected not equals via solver 358.30/292.50 [2019-03-28 12:38:54,756 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 1 358.30/292.50 [2019-03-28 12:38:54,757 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:54,774 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 0 case distinctions, treesize of input 42 treesize of output 33 358.30/292.50 [2019-03-28 12:38:54,775 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:54,928 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 38 358.30/292.50 [2019-03-28 12:38:54,928 INFO L497 ElimStorePlain]: treesize reduction 270, result has 27.4 percent of original size 358.30/292.50 [2019-03-28 12:38:54,929 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. 358.30/292.50 [2019-03-28 12:38:54,929 INFO L217 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:214, output treesize:91 358.30/292.50 [2019-03-28 12:38:55,095 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:55,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 74 358.30/292.50 [2019-03-28 12:38:55,098 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:55,195 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 358.30/292.50 [2019-03-28 12:38:55,196 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 118 358.30/292.50 [2019-03-28 12:38:55,211 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:55,382 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 41 358.30/292.50 [2019-03-28 12:38:55,382 INFO L497 ElimStorePlain]: treesize reduction 178, result has 37.8 percent of original size 358.30/292.50 [2019-03-28 12:38:55,383 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 358.30/292.50 [2019-03-28 12:38:55,383 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:91 358.30/292.50 [2019-03-28 12:38:55,429 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:55,429 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 89 358.30/292.50 [2019-03-28 12:38:55,434 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:55,472 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:55,472 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 89 358.30/292.50 [2019-03-28 12:38:55,478 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:55,569 INFO L497 ElimStorePlain]: treesize reduction 183, result has 35.6 percent of original size 358.30/292.50 [2019-03-28 12:38:55,569 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 358.30/292.50 [2019-03-28 12:38:55,569 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:111, output treesize:97 358.30/292.50 [2019-03-28 12:38:55,852 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:55,852 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 59 358.30/292.50 [2019-03-28 12:38:55,853 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:55,877 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:55,877 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 59 358.30/292.50 [2019-03-28 12:38:55,878 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:55,902 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:55,903 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 59 358.30/292.50 [2019-03-28 12:38:55,903 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:55,919 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:55,919 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 59 358.30/292.50 [2019-03-28 12:38:55,920 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:56,018 INFO L497 ElimStorePlain]: treesize reduction 80, result has 69.8 percent of original size 358.30/292.50 [2019-03-28 12:38:56,019 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:56,019 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:229, output treesize:29 358.30/292.50 [2019-03-28 12:38:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.30/292.50 [2019-03-28 12:38:56,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core 358.30/292.50 [2019-03-28 12:38:56,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.30/292.50 [2019-03-28 12:38:56,640 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:56,640 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 93 358.30/292.50 [2019-03-28 12:38:56,644 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:56,704 INFO L497 ElimStorePlain]: treesize reduction 84, result has 39.1 percent of original size 358.30/292.50 [2019-03-28 12:38:56,704 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 358.30/292.50 [2019-03-28 12:38:56,705 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:44 358.30/292.50 [2019-03-28 12:38:56,713 INFO L172 IndexEqualityManager]: detected equality via solver 358.30/292.50 [2019-03-28 12:38:56,717 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 23 358.30/292.50 [2019-03-28 12:38:56,717 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:56,722 INFO L172 IndexEqualityManager]: detected equality via solver 358.30/292.50 [2019-03-28 12:38:56,725 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 23 358.30/292.50 [2019-03-28 12:38:56,726 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:56,829 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 358.30/292.50 [2019-03-28 12:38:56,829 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 111 358.30/292.50 [2019-03-28 12:38:56,848 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:56,864 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:56,864 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 1 case distinctions, treesize of input 42 treesize of output 33 358.30/292.50 [2019-03-28 12:38:56,865 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:56,872 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 0 case distinctions, treesize of input 42 treesize of output 33 358.30/292.50 [2019-03-28 12:38:56,872 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:57,081 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 36 358.30/292.50 [2019-03-28 12:38:57,081 INFO L497 ElimStorePlain]: treesize reduction 271, result has 31.7 percent of original size 358.30/292.50 [2019-03-28 12:38:57,082 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. 358.30/292.50 [2019-03-28 12:38:57,082 INFO L217 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:214, output treesize:98 358.30/292.50 [2019-03-28 12:38:57,290 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 358.30/292.50 [2019-03-28 12:38:57,290 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 118 358.30/292.50 [2019-03-28 12:38:57,319 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:57,354 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:57,355 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 74 358.30/292.50 [2019-03-28 12:38:57,356 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:57,477 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 358.30/292.50 [2019-03-28 12:38:57,478 INFO L497 ElimStorePlain]: treesize reduction 200, result has 33.1 percent of original size 358.30/292.50 [2019-03-28 12:38:57,478 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 358.30/292.50 [2019-03-28 12:38:57,479 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:85 358.30/292.50 [2019-03-28 12:38:57,565 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:57,565 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 89 358.30/292.50 [2019-03-28 12:38:57,570 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:57,606 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:57,607 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 89 358.30/292.50 [2019-03-28 12:38:57,612 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:57,700 INFO L497 ElimStorePlain]: treesize reduction 131, result has 43.5 percent of original size 358.30/292.50 [2019-03-28 12:38:57,700 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 358.30/292.50 [2019-03-28 12:38:57,701 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:111, output treesize:97 358.30/292.50 [2019-03-28 12:38:57,981 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:57,982 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 59 358.30/292.50 [2019-03-28 12:38:57,982 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:58,008 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:58,008 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 59 358.30/292.50 [2019-03-28 12:38:58,009 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:58,035 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:58,035 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 59 358.30/292.50 [2019-03-28 12:38:58,036 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:58,055 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:58,055 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 59 358.30/292.50 [2019-03-28 12:38:58,056 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:58,157 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 358.30/292.50 [2019-03-28 12:38:58,158 INFO L497 ElimStorePlain]: treesize reduction 80, result has 69.8 percent of original size 358.30/292.50 [2019-03-28 12:38:58,158 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:58,159 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:229, output treesize:29 358.30/292.50 [2019-03-28 12:38:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.30/292.50 [2019-03-28 12:38:58,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 18 conjunts are in the unsatisfiable core 358.30/292.50 [2019-03-28 12:38:58,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.30/292.50 [2019-03-28 12:38:59,032 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 358.30/292.50 [2019-03-28 12:38:59,032 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 108 358.30/292.50 [2019-03-28 12:38:59,041 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:59,150 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 358.30/292.50 [2019-03-28 12:38:59,150 INFO L497 ElimStorePlain]: treesize reduction 140, result has 50.9 percent of original size 358.30/292.50 [2019-03-28 12:38:59,151 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. 358.30/292.50 [2019-03-28 12:38:59,151 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:142 358.30/292.50 [2019-03-28 12:38:59,742 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:38:59,742 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 77 358.30/292.50 [2019-03-28 12:38:59,745 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:59,833 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 358.30/292.50 [2019-03-28 12:38:59,833 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 118 358.30/292.50 [2019-03-28 12:38:59,854 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:38:59,973 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 358.30/292.50 [2019-03-28 12:38:59,973 INFO L497 ElimStorePlain]: treesize reduction 187, result has 35.7 percent of original size 358.30/292.50 [2019-03-28 12:38:59,974 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 358.30/292.50 [2019-03-28 12:38:59,974 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:117, output treesize:88 358.30/292.50 [2019-03-28 12:39:00,272 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:39:00,272 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 89 358.30/292.50 [2019-03-28 12:39:00,278 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:00,313 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:39:00,314 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 89 358.30/292.50 [2019-03-28 12:39:00,319 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:00,383 INFO L497 ElimStorePlain]: treesize reduction 158, result has 39.0 percent of original size 358.30/292.50 [2019-03-28 12:39:00,384 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 358.30/292.50 [2019-03-28 12:39:00,384 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:111, output treesize:97 358.30/292.50 [2019-03-28 12:39:00,666 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:39:00,666 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 59 358.30/292.50 [2019-03-28 12:39:00,667 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:00,691 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:39:00,692 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 59 358.30/292.50 [2019-03-28 12:39:00,692 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:00,718 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:39:00,718 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 59 358.30/292.50 [2019-03-28 12:39:00,719 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:00,733 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:39:00,733 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 59 358.30/292.50 [2019-03-28 12:39:00,733 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:00,832 INFO L497 ElimStorePlain]: treesize reduction 80, result has 69.8 percent of original size 358.30/292.50 [2019-03-28 12:39:00,833 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. 358.30/292.50 [2019-03-28 12:39:00,833 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:229, output treesize:149 358.30/292.50 [2019-03-28 12:39:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:39:08,728 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.30/292.50 [2019-03-28 12:39:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:39:08,750 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.30/292.50 [2019-03-28 12:39:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:39:08,772 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.30/292.50 [2019-03-28 12:39:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.30/292.50 [2019-03-28 12:39:08,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core 358.30/292.50 [2019-03-28 12:39:08,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.30/292.50 [2019-03-28 12:39:09,206 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 358.30/292.50 [2019-03-28 12:39:09,207 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 113 358.30/292.50 [2019-03-28 12:39:09,223 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:09,282 INFO L497 ElimStorePlain]: treesize reduction 133, result has 28.9 percent of original size 358.30/292.50 [2019-03-28 12:39:09,282 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:09,282 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:51 358.30/292.50 [2019-03-28 12:39:09,663 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:39:09,664 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 93 358.30/292.50 [2019-03-28 12:39:09,668 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:09,702 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:39:09,703 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 93 358.30/292.50 [2019-03-28 12:39:09,707 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:09,809 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 38 358.30/292.50 [2019-03-28 12:39:09,809 INFO L497 ElimStorePlain]: treesize reduction 167, result has 38.6 percent of original size 358.30/292.50 [2019-03-28 12:39:09,810 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 358.30/292.50 [2019-03-28 12:39:09,810 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:119, output treesize:105 358.30/292.50 [2019-03-28 12:39:09,959 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 34 treesize of output 26 358.30/292.50 [2019-03-28 12:39:09,960 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:09,967 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 34 treesize of output 26 358.30/292.50 [2019-03-28 12:39:09,967 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:10,013 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:39:10,014 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 93 358.30/292.50 [2019-03-28 12:39:10,017 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:10,053 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:39:10,053 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 93 358.30/292.50 [2019-03-28 12:39:10,056 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:10,185 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 358.30/292.50 [2019-03-28 12:39:10,185 INFO L497 ElimStorePlain]: treesize reduction 198, result has 40.2 percent of original size 358.30/292.50 [2019-03-28 12:39:10,186 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. 358.30/292.50 [2019-03-28 12:39:10,186 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:175, output treesize:95 358.30/292.50 [2019-03-28 12:39:10,347 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 358.30/292.50 [2019-03-28 12:39:10,347 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:10,385 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:39:10,385 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 46 treesize of output 78 358.30/292.50 [2019-03-28 12:39:10,387 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:10,424 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:39:10,425 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 46 treesize of output 78 358.30/292.50 [2019-03-28 12:39:10,426 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:10,431 INFO L189 IndexEqualityManager]: detected not equals via solver 358.30/292.50 [2019-03-28 12:39:10,432 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 358.30/292.50 [2019-03-28 12:39:10,432 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:10,499 INFO L497 ElimStorePlain]: treesize reduction 75, result has 59.2 percent of original size 358.30/292.50 [2019-03-28 12:39:10,500 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 358.30/292.50 [2019-03-28 12:39:10,500 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:147, output treesize:91 358.30/292.50 [2019-03-28 12:39:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:39:12,473 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.30/292.50 [2019-03-28 12:39:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:39:12,499 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.30/292.50 [2019-03-28 12:39:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:39:12,530 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.30/292.50 [2019-03-28 12:39:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.30/292.50 [2019-03-28 12:39:12,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core 358.30/292.50 [2019-03-28 12:39:12,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.30/292.50 [2019-03-28 12:39:12,783 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:39:12,783 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 92 358.30/292.50 [2019-03-28 12:39:12,787 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:12,848 INFO L497 ElimStorePlain]: treesize reduction 52, result has 58.1 percent of original size 358.30/292.50 [2019-03-28 12:39:12,849 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:12,849 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:72 358.30/292.50 [2019-03-28 12:39:13,577 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 34 treesize of output 26 358.30/292.50 [2019-03-28 12:39:13,577 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:13,584 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 34 treesize of output 26 358.30/292.50 [2019-03-28 12:39:13,585 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:13,592 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 34 treesize of output 26 358.30/292.50 [2019-03-28 12:39:13,593 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:13,690 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 358.30/292.50 [2019-03-28 12:39:13,690 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 113 358.30/292.50 [2019-03-28 12:39:13,700 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:13,707 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 34 treesize of output 26 358.30/292.50 [2019-03-28 12:39:13,708 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:13,855 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 38 358.30/292.50 [2019-03-28 12:39:13,856 INFO L497 ElimStorePlain]: treesize reduction 195, result has 40.0 percent of original size 358.30/292.50 [2019-03-28 12:39:13,856 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. 358.30/292.50 [2019-03-28 12:39:13,856 INFO L217 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:184, output treesize:84 358.30/292.50 [2019-03-28 12:39:14,042 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 358.30/292.50 [2019-03-28 12:39:14,043 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:14,048 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 358.30/292.50 [2019-03-28 12:39:14,049 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:14,054 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 358.30/292.50 [2019-03-28 12:39:14,054 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:14,106 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:39:14,106 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 98 358.30/292.50 [2019-03-28 12:39:14,112 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:14,120 INFO L189 IndexEqualityManager]: detected not equals via solver 358.30/292.50 [2019-03-28 12:39:14,120 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 358.30/292.50 [2019-03-28 12:39:14,120 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:14,226 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 358.30/292.50 [2019-03-28 12:39:14,226 INFO L497 ElimStorePlain]: treesize reduction 125, result has 38.1 percent of original size 358.30/292.50 [2019-03-28 12:39:14,227 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 358.30/292.50 [2019-03-28 12:39:14,227 INFO L217 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:149, output treesize:66 358.30/292.50 [2019-03-28 12:39:15,051 INFO L172 IndexEqualityManager]: detected equality via solver 358.30/292.50 [2019-03-28 12:39:15,055 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 26 358.30/292.50 [2019-03-28 12:39:15,055 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:15,066 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 0 case distinctions, treesize of input 45 treesize of output 36 358.30/292.50 [2019-03-28 12:39:15,066 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:15,071 INFO L172 IndexEqualityManager]: detected equality via solver 358.30/292.50 [2019-03-28 12:39:15,075 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 26 358.30/292.50 [2019-03-28 12:39:15,075 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:15,174 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 358.30/292.50 [2019-03-28 12:39:15,174 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 116 358.30/292.50 [2019-03-28 12:39:15,194 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:15,204 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:39:15,205 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 1 case distinctions, treesize of input 45 treesize of output 36 358.30/292.50 [2019-03-28 12:39:15,205 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:15,364 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 358.30/292.50 [2019-03-28 12:39:15,365 INFO L497 ElimStorePlain]: treesize reduction 229, result has 39.7 percent of original size 358.30/292.50 [2019-03-28 12:39:15,365 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. 358.30/292.50 [2019-03-28 12:39:15,365 INFO L217 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:239, output treesize:123 358.30/292.50 [2019-03-28 12:39:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:39:18,133 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.30/292.50 [2019-03-28 12:39:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.30/292.50 [2019-03-28 12:39:18,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core 358.30/292.50 [2019-03-28 12:39:18,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.30/292.50 [2019-03-28 12:39:18,189 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:39:18,189 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 87 358.30/292.50 [2019-03-28 12:39:18,192 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:18,258 INFO L497 ElimStorePlain]: treesize reduction 44, result has 61.1 percent of original size 358.30/292.50 [2019-03-28 12:39:18,259 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:18,259 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:69 358.30/292.50 [2019-03-28 12:39:18,975 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 31 treesize of output 23 358.30/292.50 [2019-03-28 12:39:18,975 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:18,982 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 31 treesize of output 23 358.30/292.50 [2019-03-28 12:39:18,982 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:18,989 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 31 treesize of output 23 358.30/292.50 [2019-03-28 12:39:18,990 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:19,089 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 358.30/292.50 [2019-03-28 12:39:19,090 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 109 358.30/292.50 [2019-03-28 12:39:19,092 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:19,101 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 31 treesize of output 23 358.30/292.50 [2019-03-28 12:39:19,101 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:19,163 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:39:19,163 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 112 358.30/292.50 [2019-03-28 12:39:19,169 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:19,222 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:39:19,222 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 112 358.30/292.50 [2019-03-28 12:39:19,228 INFO L427 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:19,434 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 40 358.30/292.50 [2019-03-28 12:39:19,435 INFO L497 ElimStorePlain]: treesize reduction 511, result has 16.5 percent of original size 358.30/292.50 [2019-03-28 12:39:19,435 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. 358.30/292.50 [2019-03-28 12:39:19,435 INFO L217 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:236, output treesize:63 358.30/292.50 [2019-03-28 12:39:19,865 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:39:19,865 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 93 358.30/292.50 [2019-03-28 12:39:19,869 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:19,875 INFO L189 IndexEqualityManager]: detected not equals via solver 358.30/292.50 [2019-03-28 12:39:19,875 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 358.30/292.50 [2019-03-28 12:39:19,876 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:19,880 INFO L189 IndexEqualityManager]: detected not equals via solver 358.30/292.50 [2019-03-28 12:39:19,881 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 358.30/292.50 [2019-03-28 12:39:19,881 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:19,886 INFO L189 IndexEqualityManager]: detected not equals via solver 358.30/292.50 [2019-03-28 12:39:19,886 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 358.30/292.50 [2019-03-28 12:39:19,887 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:19,891 INFO L189 IndexEqualityManager]: detected not equals via solver 358.30/292.50 [2019-03-28 12:39:19,891 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 358.30/292.50 [2019-03-28 12:39:19,891 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:19,948 INFO L497 ElimStorePlain]: treesize reduction 84, result has 39.1 percent of original size 358.30/292.50 [2019-03-28 12:39:19,949 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 358.30/292.50 [2019-03-28 12:39:19,949 INFO L217 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:124, output treesize:44 358.30/292.50 [2019-03-28 12:39:19,966 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:39:19,966 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 1 case distinctions, treesize of input 42 treesize of output 33 358.30/292.50 [2019-03-28 12:39:19,966 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:19,979 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 0 case distinctions, treesize of input 42 treesize of output 33 358.30/292.50 [2019-03-28 12:39:19,979 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:20,076 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 358.30/292.50 [2019-03-28 12:39:20,077 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 111 358.30/292.50 [2019-03-28 12:39:20,099 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:20,106 INFO L172 IndexEqualityManager]: detected equality via solver 358.30/292.50 [2019-03-28 12:39:20,109 INFO L189 IndexEqualityManager]: detected not equals via solver 358.30/292.50 [2019-03-28 12:39:20,109 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 1 358.30/292.50 [2019-03-28 12:39:20,110 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:20,115 INFO L189 IndexEqualityManager]: detected not equals via solver 358.30/292.50 [2019-03-28 12:39:20,116 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 1 358.30/292.50 [2019-03-28 12:39:20,116 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:20,248 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 358.30/292.50 [2019-03-28 12:39:20,248 INFO L497 ElimStorePlain]: treesize reduction 197, result has 41.0 percent of original size 358.30/292.50 [2019-03-28 12:39:20,249 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. 358.30/292.50 [2019-03-28 12:39:20,249 INFO L217 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:214, output treesize:131 358.30/292.50 [2019-03-28 12:39:21,671 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:39:21,671 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 122 358.30/292.50 [2019-03-28 12:39:21,685 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:21,721 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:39:21,722 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 358.30/292.50 [2019-03-28 12:39:21,724 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:21,772 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:39:21,772 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 122 358.30/292.50 [2019-03-28 12:39:21,797 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:39:22,068 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 61 358.30/292.50 [2019-03-28 12:39:22,068 INFO L497 ElimStorePlain]: treesize reduction 403, result has 29.0 percent of original size 358.30/292.50 [2019-03-28 12:39:22,069 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. 358.30/292.50 [2019-03-28 12:39:22,070 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:176, output treesize:145 358.30/292.50 [2019-03-28 12:39:23,377 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 358.30/292.50 [2019-03-28 12:39:23,882 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 358.30/292.50 [2019-03-28 12:39:27,189 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 358.30/292.50 [2019-03-28 12:39:36,617 WARN L188 SmtUtils]: Spent 4.92 s on a formula simplification that was a NOOP. DAG size: 55 358.30/292.50 [2019-03-28 12:39:36,618 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 358.30/292.50 [2019-03-28 12:39:37,597 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 358.30/292.50 [2019-03-28 12:39:38,575 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 31 358.30/292.50 [2019-03-28 12:39:39,163 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 30 358.30/292.50 [2019-03-28 12:39:39,338 INFO L98 LoopCannibalizer]: 62 predicates before loop cannibalization 207 predicates after loop cannibalization 358.30/292.50 [2019-03-28 12:39:39,339 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 207 loop predicates 358.30/292.50 [2019-03-28 12:39:39,339 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 114 states and 141 transitions. cyclomatic complexity: 32 Second operand 19 states. 358.30/292.50 [2019-03-28 12:39:40,478 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 22 358.30/292.50 [2019-03-28 12:39:41,406 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 25 358.30/292.50 [2019-03-28 12:39:43,037 WARN L188 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 22 358.30/292.50 [2019-03-28 12:39:44,175 WARN L188 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 20 358.30/292.50 [2019-03-28 12:39:45,208 WARN L188 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 24 358.30/292.50 [2019-03-28 12:39:46,300 WARN L188 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 22 358.30/292.50 [2019-03-28 12:39:47,592 WARN L188 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 35 358.30/292.50 [2019-03-28 12:39:49,163 WARN L188 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 37 358.30/292.50 [2019-03-28 12:39:50,533 WARN L188 SmtUtils]: Spent 763.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 42 358.30/292.50 [2019-03-28 12:39:53,034 WARN L188 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 45 358.30/292.50 [2019-03-28 12:39:55,699 WARN L188 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 38 358.30/292.50 [2019-03-28 12:39:57,185 WARN L188 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 30 358.30/292.50 [2019-03-28 12:39:58,773 WARN L188 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 40 358.30/292.50 [2019-03-28 12:40:00,307 WARN L188 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 33 358.30/292.50 [2019-03-28 12:40:07,306 WARN L188 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 39 358.30/292.50 [2019-03-28 12:40:09,050 WARN L188 SmtUtils]: Spent 978.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 28 358.30/292.50 [2019-03-28 12:40:10,558 WARN L188 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 251 DAG size of output: 23 358.30/292.50 [2019-03-28 12:40:12,369 WARN L188 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 42 358.30/292.50 [2019-03-28 12:40:15,558 WARN L188 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 294 DAG size of output: 30 358.30/292.50 [2019-03-28 12:40:17,102 WARN L188 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 25 358.30/292.50 [2019-03-28 12:40:17,639 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 23 358.30/292.50 [2019-03-28 12:40:18,083 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 26 358.30/292.50 [2019-03-28 12:40:18,533 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 26 358.30/292.50 [2019-03-28 12:40:20,036 WARN L188 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 45 358.30/292.50 [2019-03-28 12:40:21,699 WARN L188 SmtUtils]: Spent 867.00 ms on a formula simplification. DAG size of input: 270 DAG size of output: 31 358.30/292.50 [2019-03-28 12:40:24,353 WARN L188 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 32 358.30/292.50 [2019-03-28 12:40:26,451 WARN L188 SmtUtils]: Spent 940.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 34 358.30/292.50 [2019-03-28 12:40:27,701 WARN L188 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 31 358.30/292.50 [2019-03-28 12:40:29,347 WARN L188 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 266 DAG size of output: 35 358.30/292.50 [2019-03-28 12:40:31,534 WARN L188 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 278 DAG size of output: 37 358.30/292.50 [2019-03-28 12:40:33,354 WARN L188 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 38 358.30/292.50 [2019-03-28 12:40:37,441 WARN L188 SmtUtils]: Spent 979.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 27 358.30/292.50 [2019-03-28 12:40:39,090 WARN L188 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 28 358.30/292.50 [2019-03-28 12:40:40,725 WARN L188 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 42 358.30/292.50 [2019-03-28 12:40:42,396 WARN L188 SmtUtils]: Spent 920.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 28 358.30/292.50 [2019-03-28 12:40:44,150 WARN L188 SmtUtils]: Spent 994.00 ms on a formula simplification. DAG size of input: 281 DAG size of output: 29 358.30/292.50 [2019-03-28 12:40:45,838 WARN L188 SmtUtils]: Spent 765.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 30 358.30/292.50 [2019-03-28 12:40:50,737 WARN L188 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 45 358.30/292.50 [2019-03-28 12:40:51,717 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 35 358.30/292.50 [2019-03-28 12:40:52,149 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 33 358.30/292.50 [2019-03-28 12:40:54,828 WARN L188 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 38 358.30/292.50 [2019-03-28 12:40:56,377 WARN L188 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 35 358.30/292.50 [2019-03-28 12:40:57,797 WARN L188 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 36 358.30/292.50 [2019-03-28 12:40:59,116 WARN L188 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 40 358.30/292.50 [2019-03-28 12:41:00,137 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 114 states and 141 transitions. cyclomatic complexity: 32. Second operand 19 states. Result 1101 states and 1258 transitions. Complement of second has 266 states. 358.30/292.50 [2019-03-28 12:41:00,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 60 states 1 stem states 53 non-accepting loop states 6 accepting loop states 358.30/292.50 [2019-03-28 12:41:00,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 358.30/292.50 [2019-03-28 12:41:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. 358.30/292.50 [2019-03-28 12:41:00,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 90 transitions. Stem has 5 letters. Loop has 23 letters. 358.30/292.50 [2019-03-28 12:41:00,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.30/292.50 [2019-03-28 12:41:00,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 90 transitions. Stem has 28 letters. Loop has 23 letters. 358.30/292.50 [2019-03-28 12:41:00,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.30/292.50 [2019-03-28 12:41:00,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 90 transitions. Stem has 5 letters. Loop has 46 letters. 358.30/292.50 [2019-03-28 12:41:00,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.30/292.50 [2019-03-28 12:41:00,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1101 states and 1258 transitions. 358.30/292.50 [2019-03-28 12:41:00,156 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 358.30/292.50 [2019-03-28 12:41:00,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1101 states to 420 states and 489 transitions. 358.30/292.50 [2019-03-28 12:41:00,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 358.30/292.50 [2019-03-28 12:41:00,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 358.30/292.50 [2019-03-28 12:41:00,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 420 states and 489 transitions. 358.30/292.50 [2019-03-28 12:41:00,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 358.30/292.50 [2019-03-28 12:41:00,159 INFO L706 BuchiCegarLoop]: Abstraction has 420 states and 489 transitions. 358.30/292.50 [2019-03-28 12:41:00,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states and 489 transitions. 358.30/292.50 [2019-03-28 12:41:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 208. 358.30/292.50 [2019-03-28 12:41:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. 358.30/292.50 [2019-03-28 12:41:00,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 256 transitions. 358.30/292.50 [2019-03-28 12:41:00,167 INFO L729 BuchiCegarLoop]: Abstraction has 208 states and 256 transitions. 358.30/292.50 [2019-03-28 12:41:00,167 INFO L609 BuchiCegarLoop]: Abstraction has 208 states and 256 transitions. 358.30/292.50 [2019-03-28 12:41:00,167 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ 358.30/292.50 [2019-03-28 12:41:00,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 208 states and 256 transitions. 358.30/292.50 [2019-03-28 12:41:00,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 358.30/292.50 [2019-03-28 12:41:00,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 358.30/292.50 [2019-03-28 12:41:00,169 INFO L119 BuchiIsEmpty]: Starting construction of run 358.30/292.50 [2019-03-28 12:41:00,169 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 358.30/292.50 [2019-03-28 12:41:00,169 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 358.30/292.50 [2019-03-28 12:41:00,170 INFO L794 eck$LassoCheckResult]: Stem: 7700#ULTIMATE.startENTRY [99] 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] 7692#L-1 [127] L-1-->L7-4: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 7693#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 7716#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 7781#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 7780#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 7702#L9 358.30/292.50 [2019-03-28 12:41:00,170 INFO L796 eck$LassoCheckResult]: Loop: 7702#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 7712#L9-1 [73] L9-1-->L10: Formula: (<= |v_ULTIMATE.start_main_#t~mem5_6| |v_ULTIMATE.start_main_#t~mem6_6|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 7694#L10 [78] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~j~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~j~0.base_10) v_ULTIMATE.start_main_~j~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_8 4) (select |v_#length_15| v_ULTIMATE.start_main_~j~0.base_10)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_8)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 7695#L10-1 [168] L10-1-->L9-3: Formula: (and (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16) v_ULTIMATE.start_main_~j~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem7_6| 1))) |v_#memory_int_13|) (<= 0 v_ULTIMATE.start_main_~j~0.offset_12) (<= (+ v_ULTIMATE.start_main_~j~0.offset_12 4) (select |v_#length_23| v_ULTIMATE.start_main_~j~0.base_16)) (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~j~0.base_16))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 7701#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 7702#L9 358.30/292.50 [2019-03-28 12:41:00,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.30/292.50 [2019-03-28 12:41:00,170 INFO L82 PathProgramCache]: Analyzing trace with hash -453132391, now seen corresponding path program 1 times 358.30/292.50 [2019-03-28 12:41:00,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.30/292.50 [2019-03-28 12:41:00,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.30/292.50 [2019-03-28 12:41:00,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.30/292.50 [2019-03-28 12:41:00,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 358.30/292.50 [2019-03-28 12:41:00,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.30/292.50 [2019-03-28 12:41:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:41:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:41:00,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.30/292.50 [2019-03-28 12:41:00,181 INFO L82 PathProgramCache]: Analyzing trace with hash 99224683, now seen corresponding path program 1 times 358.30/292.50 [2019-03-28 12:41:00,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.30/292.50 [2019-03-28 12:41:00,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.30/292.50 [2019-03-28 12:41:00,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.30/292.50 [2019-03-28 12:41:00,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.30/292.50 [2019-03-28 12:41:00,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.30/292.50 [2019-03-28 12:41:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:41:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:41:00,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.30/292.50 [2019-03-28 12:41:00,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1475589165, now seen corresponding path program 1 times 358.30/292.50 [2019-03-28 12:41:00,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.30/292.50 [2019-03-28 12:41:00,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.30/292.50 [2019-03-28 12:41:00,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.30/292.50 [2019-03-28 12:41:00,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.30/292.50 [2019-03-28 12:41:00,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.30/292.50 [2019-03-28 12:41:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:41:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:41:00,438 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 358.30/292.50 [2019-03-28 12:41:00,513 INFO L216 LassoAnalysis]: Preferences: 358.30/292.50 [2019-03-28 12:41:00,513 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 358.30/292.50 [2019-03-28 12:41:00,513 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 358.30/292.50 [2019-03-28 12:41:00,513 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 358.30/292.50 [2019-03-28 12:41:00,513 INFO L127 ssoRankerPreferences]: Use exernal solver: false 358.30/292.50 [2019-03-28 12:41:00,514 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 358.30/292.50 [2019-03-28 12:41:00,514 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 358.30/292.50 [2019-03-28 12:41:00,514 INFO L130 ssoRankerPreferences]: Path of dumped script: 358.30/292.50 [2019-03-28 12:41:00,514 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration12_Lasso 358.30/292.50 [2019-03-28 12:41:00,514 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 358.30/292.50 [2019-03-28 12:41:00,514 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 358.30/292.50 [2019-03-28 12:41:00,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.30/292.50 [2019-03-28 12:41:00,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.30/292.50 [2019-03-28 12:41:00,692 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 358.30/292.50 [2019-03-28 12:41:00,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.30/292.50 [2019-03-28 12:41:00,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.30/292.50 [2019-03-28 12:41:00,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.30/292.50 [2019-03-28 12:41:00,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.30/292.50 [2019-03-28 12:41:00,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.30/292.50 [2019-03-28 12:41:00,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.30/292.50 [2019-03-28 12:41:00,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.30/292.50 [2019-03-28 12:41:01,051 INFO L300 LassoAnalysis]: Preprocessing complete. 358.30/292.50 [2019-03-28 12:41:01,052 INFO L497 LassoAnalysis]: Using template 'affine'. 358.30/292.50 [2019-03-28 12:41:01,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:41:01,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:41:01,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:41:01,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:41:01,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:41:01,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:41:01,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.30/292.50 [2019-03-28 12:41:01,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.30/292.50 [2019-03-28 12:41:01,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:41:01,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:41:01,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:41:01,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:41:01,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:41:01,057 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:41:01,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.30/292.50 [2019-03-28 12:41:01,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.30/292.50 [2019-03-28 12:41:01,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:41:01,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:41:01,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.30/292.50 [2019-03-28 12:41:01,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:41:01,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:41:01,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:41:01,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:41:01,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.30/292.50 [2019-03-28 12:41:01,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.30/292.50 [2019-03-28 12:41:01,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:41:01,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:41:01,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:41:01,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:41:01,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:41:01,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:41:01,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.30/292.50 [2019-03-28 12:41:01,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.30/292.50 [2019-03-28 12:41:01,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:41:01,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:41:01,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:41:01,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:41:01,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:41:01,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:41:01,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.30/292.50 [2019-03-28 12:41:01,076 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 358.30/292.50 [2019-03-28 12:41:01,081 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 358.30/292.50 [2019-03-28 12:41:01,081 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. 358.30/292.50 [2019-03-28 12:41:01,081 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 358.30/292.50 [2019-03-28 12:41:01,082 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 358.30/292.50 [2019-03-28 12:41:01,082 INFO L518 LassoAnalysis]: Proved termination. 358.30/292.50 [2019-03-28 12:41:01,082 INFO L520 LassoAnalysis]: Termination argument consisting of: 358.30/292.50 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_12, v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_12) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_12 + 2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_12 + 1 358.30/292.50 Supporting invariants [1*ULTIMATE.start_main_#t~mem5 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_12 >= 0] 358.30/292.50 [2019-03-28 12:41:01,141 INFO L297 tatePredicateManager]: 18 out of 21 supporting invariants were superfluous and have been removed 358.30/292.50 [2019-03-28 12:41:01,148 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 358.30/292.50 [2019-03-28 12:41:01,148 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 358.30/292.50 [2019-03-28 12:41:01,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.30/292.50 [2019-03-28 12:41:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.30/292.50 [2019-03-28 12:41:01,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core 358.30/292.50 [2019-03-28 12:41:01,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.30/292.50 [2019-03-28 12:41:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.30/292.50 [2019-03-28 12:41:01,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core 358.30/292.50 [2019-03-28 12:41:01,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.30/292.50 [2019-03-28 12:41:01,296 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 0 case distinctions, treesize of input 51 treesize of output 34 358.30/292.50 [2019-03-28 12:41:01,297 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.30/292.50 [2019-03-28 12:41:01,309 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:41:01,309 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.30/292.50 [2019-03-28 12:41:01,310 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:39 358.30/292.50 [2019-03-28 12:41:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 358.30/292.50 [2019-03-28 12:41:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:41:01,507 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.30/292.50 [2019-03-28 12:41:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:41:01,513 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.30/292.50 [2019-03-28 12:41:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:41:01,519 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.30/292.50 [2019-03-28 12:41:01,519 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization 358.30/292.50 [2019-03-28 12:41:01,520 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 8 loop predicates 358.30/292.50 [2019-03-28 12:41:01,520 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 208 states and 256 transitions. cyclomatic complexity: 56 Second operand 7 states. 358.30/292.50 [2019-03-28 12:41:02,355 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 208 states and 256 transitions. cyclomatic complexity: 56. Second operand 7 states. Result 2781 states and 3216 transitions. Complement of second has 148 states. 358.30/292.50 [2019-03-28 12:41:02,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 28 states 5 stem states 20 non-accepting loop states 3 accepting loop states 358.30/292.50 [2019-03-28 12:41:02,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 358.30/292.50 [2019-03-28 12:41:02,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 97 transitions. 358.30/292.50 [2019-03-28 12:41:02,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 97 transitions. Stem has 6 letters. Loop has 5 letters. 358.30/292.50 [2019-03-28 12:41:02,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.30/292.50 [2019-03-28 12:41:02,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 97 transitions. Stem has 11 letters. Loop has 5 letters. 358.30/292.50 [2019-03-28 12:41:02,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.30/292.50 [2019-03-28 12:41:02,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 97 transitions. Stem has 6 letters. Loop has 10 letters. 358.30/292.50 [2019-03-28 12:41:02,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.30/292.50 [2019-03-28 12:41:02,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2781 states and 3216 transitions. 358.30/292.50 [2019-03-28 12:41:02,382 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 30 358.30/292.50 [2019-03-28 12:41:02,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2781 states to 707 states and 844 transitions. 358.30/292.50 [2019-03-28 12:41:02,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 358.30/292.50 [2019-03-28 12:41:02,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 358.30/292.50 [2019-03-28 12:41:02,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 707 states and 844 transitions. 358.30/292.50 [2019-03-28 12:41:02,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 358.30/292.50 [2019-03-28 12:41:02,387 INFO L706 BuchiCegarLoop]: Abstraction has 707 states and 844 transitions. 358.30/292.50 [2019-03-28 12:41:02,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states and 844 transitions. 358.30/292.50 [2019-03-28 12:41:02,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 208. 358.30/292.50 [2019-03-28 12:41:02,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. 358.30/292.50 [2019-03-28 12:41:02,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 254 transitions. 358.30/292.50 [2019-03-28 12:41:02,395 INFO L729 BuchiCegarLoop]: Abstraction has 208 states and 254 transitions. 358.30/292.50 [2019-03-28 12:41:02,395 INFO L609 BuchiCegarLoop]: Abstraction has 208 states and 254 transitions. 358.30/292.50 [2019-03-28 12:41:02,395 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ 358.30/292.50 [2019-03-28 12:41:02,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 208 states and 254 transitions. 358.30/292.50 [2019-03-28 12:41:02,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 358.30/292.50 [2019-03-28 12:41:02,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 358.30/292.50 [2019-03-28 12:41:02,397 INFO L119 BuchiIsEmpty]: Starting construction of run 358.30/292.50 [2019-03-28 12:41:02,397 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 358.30/292.50 [2019-03-28 12:41:02,397 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 358.30/292.50 [2019-03-28 12:41:02,398 INFO L794 eck$LassoCheckResult]: Stem: 11037#ULTIMATE.startENTRY [99] 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] 11029#L-1 [126] L-1-->L7-4: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 11030#L7-4 [87] L7-4-->L7-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 11053#L7-1 [170] L7-1-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7)) (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6)) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 11056#L8 [92] L8-->L9-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 11085#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 11039#L9 358.30/292.50 [2019-03-28 12:41:02,398 INFO L796 eck$LassoCheckResult]: Loop: 11039#L9 [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 11049#L9-1 [73] L9-1-->L10: Formula: (<= |v_ULTIMATE.start_main_#t~mem5_6| |v_ULTIMATE.start_main_#t~mem6_6|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 11031#L10 [78] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~j~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~j~0.base_10) v_ULTIMATE.start_main_~j~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_8 4) (select |v_#length_15| v_ULTIMATE.start_main_~j~0.base_10)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_8)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 11032#L10-1 [168] L10-1-->L9-3: Formula: (and (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~j~0.base_16) v_ULTIMATE.start_main_~j~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem7_6| 1))) |v_#memory_int_13|) (<= 0 v_ULTIMATE.start_main_~j~0.offset_12) (<= (+ v_ULTIMATE.start_main_~j~0.offset_12 4) (select |v_#length_23| v_ULTIMATE.start_main_~j~0.base_16)) (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~j~0.base_16))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 11038#L9-3 [69] L9-3-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 11039#L9 358.30/292.50 [2019-03-28 12:41:02,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.30/292.50 [2019-03-28 12:41:02,399 INFO L82 PathProgramCache]: Analyzing trace with hash -454055912, now seen corresponding path program 1 times 358.30/292.50 [2019-03-28 12:41:02,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.30/292.50 [2019-03-28 12:41:02,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.30/292.50 [2019-03-28 12:41:02,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.30/292.50 [2019-03-28 12:41:02,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.30/292.50 [2019-03-28 12:41:02,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.30/292.50 [2019-03-28 12:41:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:41:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:41:02,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.30/292.50 [2019-03-28 12:41:02,408 INFO L82 PathProgramCache]: Analyzing trace with hash 99224683, now seen corresponding path program 2 times 358.30/292.50 [2019-03-28 12:41:02,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.30/292.50 [2019-03-28 12:41:02,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.30/292.50 [2019-03-28 12:41:02,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.30/292.50 [2019-03-28 12:41:02,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 358.30/292.50 [2019-03-28 12:41:02,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.30/292.50 [2019-03-28 12:41:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:41:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:41:02,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.30/292.50 [2019-03-28 12:41:02,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1279075660, now seen corresponding path program 1 times 358.30/292.50 [2019-03-28 12:41:02,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 358.30/292.50 [2019-03-28 12:41:02,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 358.30/292.50 [2019-03-28 12:41:02,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.30/292.50 [2019-03-28 12:41:02,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 358.30/292.50 [2019-03-28 12:41:02,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 358.30/292.50 [2019-03-28 12:41:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:41:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:41:02,798 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 358.30/292.50 [2019-03-28 12:41:02,930 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 75 358.30/292.50 [2019-03-28 12:41:02,933 INFO L216 LassoAnalysis]: Preferences: 358.30/292.50 [2019-03-28 12:41:02,933 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 358.30/292.50 [2019-03-28 12:41:02,933 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 358.30/292.50 [2019-03-28 12:41:02,933 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 358.30/292.50 [2019-03-28 12:41:02,933 INFO L127 ssoRankerPreferences]: Use exernal solver: false 358.30/292.50 [2019-03-28 12:41:02,933 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 358.30/292.50 [2019-03-28 12:41:02,933 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 358.30/292.50 [2019-03-28 12:41:02,934 INFO L130 ssoRankerPreferences]: Path of dumped script: 358.30/292.50 [2019-03-28 12:41:02,934 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration13_Lasso 358.30/292.50 [2019-03-28 12:41:02,934 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 358.30/292.50 [2019-03-28 12:41:02,934 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 358.30/292.50 [2019-03-28 12:41:02,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.30/292.50 [2019-03-28 12:41:02,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.30/292.50 [2019-03-28 12:41:02,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.30/292.50 [2019-03-28 12:41:02,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.30/292.50 [2019-03-28 12:41:02,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.30/292.50 [2019-03-28 12:41:02,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.30/292.50 [2019-03-28 12:41:02,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.30/292.50 [2019-03-28 12:41:02,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.30/292.50 [2019-03-28 12:41:02,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 358.30/292.50 [2019-03-28 12:41:03,155 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 358.30/292.50 [2019-03-28 12:41:03,508 INFO L300 LassoAnalysis]: Preprocessing complete. 358.30/292.50 [2019-03-28 12:41:03,508 INFO L497 LassoAnalysis]: Using template 'affine'. 358.30/292.50 [2019-03-28 12:41:03,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:41:03,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:41:03,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:41:03,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:41:03,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:41:03,510 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:41:03,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.30/292.50 [2019-03-28 12:41:03,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.30/292.50 [2019-03-28 12:41:03,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:41:03,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:41:03,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.30/292.50 [2019-03-28 12:41:03,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:41:03,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:41:03,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:41:03,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:41:03,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.30/292.50 [2019-03-28 12:41:03,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.30/292.50 [2019-03-28 12:41:03,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:41:03,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:41:03,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.30/292.50 [2019-03-28 12:41:03,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:41:03,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:41:03,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:41:03,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:41:03,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.30/292.50 [2019-03-28 12:41:03,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.30/292.50 [2019-03-28 12:41:03,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:41:03,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:41:03,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.30/292.50 [2019-03-28 12:41:03,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:41:03,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:41:03,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:41:03,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:41:03,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.30/292.50 [2019-03-28 12:41:03,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.30/292.50 [2019-03-28 12:41:03,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:41:03,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:41:03,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.30/292.50 [2019-03-28 12:41:03,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:41:03,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:41:03,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:41:03,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:41:03,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.30/292.50 [2019-03-28 12:41:03,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.30/292.50 [2019-03-28 12:41:03,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:41:03,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:41:03,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:41:03,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:41:03,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:41:03,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:41:03,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.30/292.50 [2019-03-28 12:41:03,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.30/292.50 [2019-03-28 12:41:03,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:41:03,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:41:03,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.30/292.50 [2019-03-28 12:41:03,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:41:03,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:41:03,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:41:03,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:41:03,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.30/292.50 [2019-03-28 12:41:03,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.30/292.50 [2019-03-28 12:41:03,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:41:03,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:41:03,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 358.30/292.50 [2019-03-28 12:41:03,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:41:03,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:41:03,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:41:03,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:41:03,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 358.30/292.50 [2019-03-28 12:41:03,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 358.30/292.50 [2019-03-28 12:41:03,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 358.30/292.50 Termination analysis: LINEAR_WITH_GUESSES 358.30/292.50 Number of strict supporting invariants: 0 358.30/292.50 Number of non-strict supporting invariants: 1 358.30/292.50 Consider only non-deceasing supporting invariants: true 358.30/292.50 Simplify termination arguments: true 358.30/292.50 Simplify supporting invariants: trueOverapproximate stem: false 358.30/292.50 [2019-03-28 12:41:03,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. 358.30/292.50 [2019-03-28 12:41:03,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 358.30/292.50 [2019-03-28 12:41:03,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 358.30/292.50 [2019-03-28 12:41:03,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 358.30/292.50 [2019-03-28 12:41:03,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 358.30/292.50 [2019-03-28 12:41:03,524 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 358.30/292.50 [2019-03-28 12:41:03,529 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 358.30/292.50 [2019-03-28 12:41:03,532 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 358.30/292.50 [2019-03-28 12:41:03,532 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. 358.30/292.50 [2019-03-28 12:41:03,533 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 358.30/292.50 [2019-03-28 12:41:03,533 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 358.30/292.50 [2019-03-28 12:41:03,534 INFO L518 LassoAnalysis]: Proved termination. 358.30/292.50 [2019-03-28 12:41:03,534 INFO L520 LassoAnalysis]: Termination argument consisting of: 358.30/292.50 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_13, v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_13) = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_13 - 2*v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_13 + 1 358.30/292.50 Supporting invariants [1*ULTIMATE.start_main_#t~mem5 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_13 >= 0] 358.30/292.50 [2019-03-28 12:41:03,595 INFO L297 tatePredicateManager]: 18 out of 21 supporting invariants were superfluous and have been removed 358.30/292.50 [2019-03-28 12:41:03,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 358.30/292.50 [2019-03-28 12:41:03,608 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 358.30/292.50 [2019-03-28 12:41:03,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 358.30/292.50 [2019-03-28 12:41:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.30/292.50 [2019-03-28 12:41:03,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core 358.30/292.50 [2019-03-28 12:41:03,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.30/292.50 [2019-03-28 12:41:03,662 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 10 treesize of output 8 358.30/292.50 [2019-03-28 12:41:03,662 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:41:03,668 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:41:03,668 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 358.30/292.50 [2019-03-28 12:41:03,668 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 358.30/292.50 [2019-03-28 12:41:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 358.30/292.50 [2019-03-28 12:41:03,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core 358.30/292.50 [2019-03-28 12:41:03,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... 358.30/292.50 [2019-03-28 12:41:03,778 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 0 case distinctions, treesize of input 51 treesize of output 34 358.30/292.50 [2019-03-28 12:41:03,779 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.30/292.50 [2019-03-28 12:41:03,793 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 358.30/292.50 [2019-03-28 12:41:03,794 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 358.30/292.50 [2019-03-28 12:41:03,794 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:39 358.30/292.50 [2019-03-28 12:41:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 358.30/292.50 [2019-03-28 12:41:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:41:03,945 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.30/292.50 [2019-03-28 12:41:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:41:03,951 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.30/292.50 [2019-03-28 12:41:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 358.30/292.50 [2019-03-28 12:41:03,958 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 358.30/292.50 [2019-03-28 12:41:03,958 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization 358.30/292.50 [2019-03-28 12:41:03,958 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 8 loop predicates 358.30/292.50 [2019-03-28 12:41:03,958 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 208 states and 254 transitions. cyclomatic complexity: 54 Second operand 7 states. 358.30/292.50 [2019-03-28 12:41:04,283 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 208 states and 254 transitions. cyclomatic complexity: 54. Second operand 7 states. Result 666 states and 778 transitions. Complement of second has 40 states. 358.30/292.50 [2019-03-28 12:41:04,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 10 non-accepting loop states 2 accepting loop states 358.30/292.50 [2019-03-28 12:41:04,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 358.30/292.50 [2019-03-28 12:41:04,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 39 transitions. 358.30/292.50 [2019-03-28 12:41:04,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 39 transitions. Stem has 6 letters. Loop has 5 letters. 358.30/292.50 [2019-03-28 12:41:04,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.30/292.50 [2019-03-28 12:41:04,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 39 transitions. Stem has 11 letters. Loop has 5 letters. 358.30/292.50 [2019-03-28 12:41:04,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.30/292.50 [2019-03-28 12:41:04,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 39 transitions. Stem has 6 letters. Loop has 10 letters. 358.30/292.50 [2019-03-28 12:41:04,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. 358.30/292.50 [2019-03-28 12:41:04,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 666 states and 778 transitions. 358.30/292.50 [2019-03-28 12:41:04,300 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 358.30/292.50 [2019-03-28 12:41:04,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 666 states to 0 states and 0 transitions. 358.30/292.50 [2019-03-28 12:41:04,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 358.30/292.50 [2019-03-28 12:41:04,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 358.30/292.50 [2019-03-28 12:41:04,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 358.30/292.50 [2019-03-28 12:41:04,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 358.30/292.50 [2019-03-28 12:41:04,301 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 358.30/292.50 [2019-03-28 12:41:04,301 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 358.30/292.50 [2019-03-28 12:41:04,301 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 358.30/292.50 [2019-03-28 12:41:04,301 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ 358.30/292.50 [2019-03-28 12:41:04,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 358.30/292.50 [2019-03-28 12:41:04,302 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 358.30/292.50 [2019-03-28 12:41:04,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 358.30/292.50 [2019-03-28 12:41:04,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:41:04 BasicIcfg 358.30/292.50 [2019-03-28 12:41:04,308 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 358.30/292.50 [2019-03-28 12:41:04,308 INFO L168 Benchmark]: Toolchain (without parser) took 288089.46 ms. Allocated memory was 649.6 MB in the beginning and 693.1 MB in the end (delta: 43.5 MB). Free memory was 565.1 MB in the beginning and 599.0 MB in the end (delta: -33.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 358.30/292.50 [2019-03-28 12:41:04,309 INFO L168 Benchmark]: CDTParser took 0.16 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. 358.30/292.50 [2019-03-28 12:41:04,309 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.23 ms. Allocated memory was 649.6 MB in the beginning and 682.6 MB in the end (delta: 33.0 MB). Free memory was 563.8 MB in the beginning and 650.0 MB in the end (delta: -86.3 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 358.30/292.50 [2019-03-28 12:41:04,309 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.13 ms. Allocated memory is still 682.6 MB. Free memory was 650.0 MB in the beginning and 646.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 358.30/292.50 [2019-03-28 12:41:04,309 INFO L168 Benchmark]: Boogie Preprocessor took 24.37 ms. Allocated memory is still 682.6 MB. Free memory was 646.9 MB in the beginning and 645.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 358.30/292.50 [2019-03-28 12:41:04,310 INFO L168 Benchmark]: RCFGBuilder took 328.40 ms. Allocated memory is still 682.6 MB. Free memory was 645.6 MB in the beginning and 622.0 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 50.3 GB. 358.30/292.50 [2019-03-28 12:41:04,310 INFO L168 Benchmark]: BlockEncodingV2 took 141.21 ms. Allocated memory is still 682.6 MB. Free memory was 622.0 MB in the beginning and 612.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 358.30/292.50 [2019-03-28 12:41:04,310 INFO L168 Benchmark]: TraceAbstraction took 1286.21 ms. Allocated memory is still 682.6 MB. Free memory was 611.2 MB in the beginning and 484.7 MB in the end (delta: 126.5 MB). Peak memory consumption was 126.5 MB. Max. memory is 50.3 GB. 358.30/292.50 [2019-03-28 12:41:04,310 INFO L168 Benchmark]: BuchiAutomizer took 285953.23 ms. Allocated memory was 682.6 MB in the beginning and 693.1 MB in the end (delta: 10.5 MB). Free memory was 484.7 MB in the beginning and 599.0 MB in the end (delta: -114.3 MB). There was no memory consumed. Max. memory is 50.3 GB. 358.30/292.50 [2019-03-28 12:41:04,313 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 358.30/292.50 --- Results --- 358.30/292.50 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 358.30/292.50 - StatisticsResult: Initial Icfg 358.30/292.50 37 locations, 40 edges 358.30/292.50 - StatisticsResult: Encoded RCFG 358.30/292.50 30 locations, 56 edges 358.30/292.50 * Results from de.uni_freiburg.informatik.ultimate.core: 358.30/292.50 - StatisticsResult: Toolchain Benchmarks 358.30/292.50 Benchmark results are: 358.30/292.50 * CDTParser took 0.16 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. 358.30/292.50 * CACSL2BoogieTranslator took 310.23 ms. Allocated memory was 649.6 MB in the beginning and 682.6 MB in the end (delta: 33.0 MB). Free memory was 563.8 MB in the beginning and 650.0 MB in the end (delta: -86.3 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 358.30/292.51 * Boogie Procedure Inliner took 40.13 ms. Allocated memory is still 682.6 MB. Free memory was 650.0 MB in the beginning and 646.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 358.30/292.51 * Boogie Preprocessor took 24.37 ms. Allocated memory is still 682.6 MB. Free memory was 646.9 MB in the beginning and 645.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 358.30/292.51 * RCFGBuilder took 328.40 ms. Allocated memory is still 682.6 MB. Free memory was 645.6 MB in the beginning and 622.0 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 50.3 GB. 358.30/292.51 * BlockEncodingV2 took 141.21 ms. Allocated memory is still 682.6 MB. Free memory was 622.0 MB in the beginning and 612.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 358.30/292.51 * TraceAbstraction took 1286.21 ms. Allocated memory is still 682.6 MB. Free memory was 611.2 MB in the beginning and 484.7 MB in the end (delta: 126.5 MB). Peak memory consumption was 126.5 MB. Max. memory is 50.3 GB. 358.30/292.51 * BuchiAutomizer took 285953.23 ms. Allocated memory was 682.6 MB in the beginning and 693.1 MB in the end (delta: 10.5 MB). Free memory was 484.7 MB in the beginning and 599.0 MB in the end (delta: -114.3 MB). There was no memory consumed. Max. memory is 50.3 GB. 358.30/292.51 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #length 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #length 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #length 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #length 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #length 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #length 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #length 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #length 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #length 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #length 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #length 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #length 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #memory_int 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #memory_int 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #memory_int 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #memory_int 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #memory_int 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #memory_int 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #memory_int 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #memory_int 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #memory_int 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #memory_int 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #memory_int 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #memory_int 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #memory_int 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #memory_int 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #memory_int 358.30/292.51 - GenericResult: Unfinished Backtranslation 358.30/292.51 unknown boogie variable #memory_int 358.30/292.51 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 358.30/292.51 - PositiveResult [Line: 8]: pointer dereference always succeeds 358.30/292.51 For all program executions holds that pointer dereference always succeeds at this location 358.30/292.51 - PositiveResult [Line: 12]: pointer dereference always succeeds 358.30/292.51 For all program executions holds that pointer dereference always succeeds at this location 358.30/292.51 - PositiveResult [Line: 7]: pointer dereference always succeeds 358.30/292.51 For all program executions holds that pointer dereference always succeeds at this location 358.30/292.51 - PositiveResult [Line: 12]: pointer dereference always succeeds 358.30/292.51 For all program executions holds that pointer dereference always succeeds at this location 358.30/292.51 - PositiveResult [Line: 8]: pointer dereference always succeeds 358.30/292.51 For all program executions holds that pointer dereference always succeeds at this location 358.30/292.51 - PositiveResult [Line: 12]: pointer dereference always succeeds 358.30/292.51 For all program executions holds that pointer dereference always succeeds at this location 358.30/292.51 - PositiveResult [Line: 12]: pointer dereference always succeeds 358.30/292.51 For all program executions holds that pointer dereference always succeeds at this location 358.30/292.51 - PositiveResult [Line: 9]: pointer dereference always succeeds 358.30/292.51 For all program executions holds that pointer dereference always succeeds at this location 358.30/292.51 - PositiveResult [Line: 9]: pointer dereference always succeeds 358.30/292.51 For all program executions holds that pointer dereference always succeeds at this location 358.30/292.51 - PositiveResult [Line: 9]: pointer dereference always succeeds 358.30/292.51 For all program executions holds that pointer dereference always succeeds at this location 358.30/292.51 - PositiveResult [Line: 9]: pointer dereference always succeeds 358.30/292.51 For all program executions holds that pointer dereference always succeeds at this location 358.30/292.51 - PositiveResult [Line: 7]: pointer dereference always succeeds 358.30/292.51 For all program executions holds that pointer dereference always succeeds at this location 358.30/292.51 - PositiveResult [Line: 10]: pointer dereference always succeeds 358.30/292.51 For all program executions holds that pointer dereference always succeeds at this location 358.30/292.51 - PositiveResult [Line: 10]: pointer dereference always succeeds 358.30/292.51 For all program executions holds that pointer dereference always succeeds at this location 358.30/292.51 - PositiveResult [Line: 7]: pointer dereference always succeeds 358.30/292.51 For all program executions holds that pointer dereference always succeeds at this location 358.30/292.51 - PositiveResult [Line: 10]: pointer dereference always succeeds 358.30/292.51 For all program executions holds that pointer dereference always succeeds at this location 358.30/292.51 - PositiveResult [Line: 10]: pointer dereference always succeeds 358.30/292.51 For all program executions holds that pointer dereference always succeeds at this location 358.30/292.51 - PositiveResult [Line: 7]: pointer dereference always succeeds 358.30/292.51 For all program executions holds that pointer dereference always succeeds at this location 358.30/292.51 - AllSpecificationsHoldResult: All specifications hold 358.30/292.51 18 specifications checked. All of them hold 358.30/292.51 - InvariantResult [Line: 8]: Loop Invariant 358.30/292.51 [2019-03-28 12:41:04,317 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 358.30/292.51 [2019-03-28 12:41:04,317 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 358.30/292.51 [2019-03-28 12:41:04,317 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 358.30/292.51 [2019-03-28 12:41:04,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 358.30/292.51 [2019-03-28 12:41:04,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 358.30/292.51 [2019-03-28 12:41:04,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 358.30/292.51 Derived loop invariant: (((((((0 == n && unknown-#length-unknown[n] == 4) && 0 == j) && \valid[n] == 1) && 4 == unknown-#length-unknown[i]) && 1 == \valid[j]) && 0 == i) && 1 == \valid[i]) && unknown-#length-unknown[j] == 4 358.30/292.51 - InvariantResult [Line: 7]: Loop Invariant 358.30/292.51 [2019-03-28 12:41:04,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 358.30/292.51 [2019-03-28 12:41:04,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 358.30/292.51 [2019-03-28 12:41:04,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 358.30/292.51 [2019-03-28 12:41:04,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 358.30/292.51 [2019-03-28 12:41:04,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 358.30/292.51 [2019-03-28 12:41:04,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 358.30/292.51 Derived loop invariant: (((((((0 == n && unknown-#length-unknown[n] == 4) && 0 == j) && \valid[n] == 1) && 4 == unknown-#length-unknown[i]) && 1 == \valid[j]) && 0 == i) && 1 == \valid[i]) && unknown-#length-unknown[j] == 4 358.30/292.51 - StatisticsResult: Ultimate Automizer benchmark data 358.30/292.51 CFG has 1 procedures, 30 locations, 18 error locations. SAFE Result, 1.1s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12 SDtfs, 169 SDslu, 3 SDs, 0 SdLazy, 201 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 2 NumberOfFragments, 80 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 330 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 358.30/292.51 - StatisticsResult: Constructed decomposition of program 358.30/292.51 Your program was decomposed into 13 terminating modules (0 trivial, 0 deterministic, 13 nondeterministic). One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] and consists of 17 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] and consists of 17 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] and consists of 17 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] and consists of 17 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] and consists of 17 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] and consists of 17 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] and consists of 17 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] and consists of 17 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[i][i] + 1 and consists of 20 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[i][i] + 3 and consists of 60 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] + unknown-#memory_int-unknown[n][n] and consists of 60 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[j][j] + 2 * unknown-#memory_int-unknown[i][i] + 1 and consists of 28 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[i][i] + -2 * unknown-#memory_int-unknown[j][j] + 1 and consists of 14 locations. 358.30/292.51 - StatisticsResult: Timing statistics 358.30/292.51 BüchiAutomizer plugin needed 285.9s and 14 iterations. TraceHistogramMax:4. Analysis of lassos took 15.8s. Construction of modules took 16.5s. Büchi inclusion checks took 253.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 12. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 1333 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 208 states and ocurred in iteration 11. Nontrivial modules had stage [13, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 9/38 HoareTripleCheckerStatistics: 141 SDtfs, 2271 SDslu, 182 SDs, 0 SdLazy, 6498 SolverSat, 1719 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 16.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso13 LassoPreprocessingBenchmarks: Lassos: inital240 mio100 ax100 hnf100 lsp97 ukn69 mio100 lsp42 div100 bol100 ite100 ukn100 eq193 hnf87 smp99 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 358.30/292.51 - TerminationAnalysisResult: Termination proven 358.30/292.51 Buchi Automizer proved that your program is terminating 358.30/292.51 RESULT: Ultimate proved your program to be correct! 358.30/292.51 [MP z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (1)] Forcibly destroying the process 358.30/292.51 !SESSION 2019-03-28 12:36:12.885 ----------------------------------------------- 358.30/292.51 eclipse.buildId=unknown 358.30/292.51 java.version=1.8.0_181 358.30/292.51 java.vendor=Oracle Corporation 358.30/292.51 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 358.30/292.51 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 358.30/292.51 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 358.30/292.51 358.30/292.51 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:41:04.546 358.30/292.51 !MESSAGE The workspace will exit with unsaved changes in this session. 358.30/292.51 Received shutdown request... 358.30/292.51 Ultimate: 358.30/292.51 GTK+ Version Check 358.30/292.51 EOF