75.85/44.19 YES 75.85/44.19 75.85/44.19 Ultimate: Cannot open display: 75.85/44.19 This is Ultimate 0.1.24-8dc7c08-m 75.85/44.19 [2019-03-28 12:45:45,363 INFO L170 SettingsManager]: Resetting all preferences to default values... 75.85/44.19 [2019-03-28 12:45:45,365 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 75.85/44.19 [2019-03-28 12:45:45,376 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 75.85/44.19 [2019-03-28 12:45:45,377 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 75.85/44.19 [2019-03-28 12:45:45,378 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 75.85/44.19 [2019-03-28 12:45:45,379 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 75.85/44.19 [2019-03-28 12:45:45,380 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 75.85/44.19 [2019-03-28 12:45:45,382 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 75.85/44.19 [2019-03-28 12:45:45,383 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 75.85/44.19 [2019-03-28 12:45:45,384 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 75.85/44.19 [2019-03-28 12:45:45,384 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 75.85/44.19 [2019-03-28 12:45:45,385 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 75.85/44.19 [2019-03-28 12:45:45,386 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 75.85/44.19 [2019-03-28 12:45:45,387 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 75.85/44.19 [2019-03-28 12:45:45,387 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 75.85/44.19 [2019-03-28 12:45:45,388 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 75.85/44.19 [2019-03-28 12:45:45,390 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 75.85/44.19 [2019-03-28 12:45:45,392 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 75.85/44.19 [2019-03-28 12:45:45,393 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 75.85/44.19 [2019-03-28 12:45:45,394 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 75.85/44.19 [2019-03-28 12:45:45,395 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 75.85/44.19 [2019-03-28 12:45:45,397 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 75.85/44.19 [2019-03-28 12:45:45,398 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 75.85/44.19 [2019-03-28 12:45:45,398 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 75.85/44.19 [2019-03-28 12:45:45,399 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 75.85/44.19 [2019-03-28 12:45:45,399 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 75.85/44.19 [2019-03-28 12:45:45,400 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 75.85/44.19 [2019-03-28 12:45:45,400 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 75.85/44.19 [2019-03-28 12:45:45,401 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 75.85/44.19 [2019-03-28 12:45:45,401 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 75.85/44.19 [2019-03-28 12:45:45,402 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 75.85/44.19 [2019-03-28 12:45:45,403 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 75.85/44.19 [2019-03-28 12:45:45,403 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 75.85/44.19 [2019-03-28 12:45:45,404 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 75.85/44.19 [2019-03-28 12:45:45,404 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 75.85/44.19 [2019-03-28 12:45:45,404 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 75.85/44.19 [2019-03-28 12:45:45,405 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 75.85/44.19 [2019-03-28 12:45:45,406 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 75.85/44.19 [2019-03-28 12:45:45,406 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 75.85/44.19 [2019-03-28 12:45:45,421 INFO L110 SettingsManager]: Loading preferences was successful 75.85/44.19 [2019-03-28 12:45:45,421 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 75.85/44.19 [2019-03-28 12:45:45,422 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 75.85/44.19 [2019-03-28 12:45:45,422 INFO L133 SettingsManager]: * Rewrite not-equals=true 75.85/44.19 [2019-03-28 12:45:45,422 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 75.85/44.19 [2019-03-28 12:45:45,423 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 75.85/44.19 [2019-03-28 12:45:45,423 INFO L133 SettingsManager]: * Use SBE=true 75.85/44.19 [2019-03-28 12:45:45,423 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 75.85/44.19 [2019-03-28 12:45:45,423 INFO L133 SettingsManager]: * Use old map elimination=false 75.85/44.19 [2019-03-28 12:45:45,423 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 75.85/44.19 [2019-03-28 12:45:45,423 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 75.85/44.19 [2019-03-28 12:45:45,424 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 75.85/44.19 [2019-03-28 12:45:45,424 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 75.85/44.19 [2019-03-28 12:45:45,424 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 75.85/44.19 [2019-03-28 12:45:45,424 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 75.85/44.19 [2019-03-28 12:45:45,424 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 75.85/44.19 [2019-03-28 12:45:45,425 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 75.85/44.19 [2019-03-28 12:45:45,425 INFO L133 SettingsManager]: * Check division by zero=IGNORE 75.85/44.19 [2019-03-28 12:45:45,425 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 75.85/44.19 [2019-03-28 12:45:45,425 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 75.85/44.19 [2019-03-28 12:45:45,425 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 75.85/44.19 [2019-03-28 12:45:45,425 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 75.85/44.19 [2019-03-28 12:45:45,426 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 75.85/44.19 [2019-03-28 12:45:45,426 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 75.85/44.19 [2019-03-28 12:45:45,426 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 75.85/44.19 [2019-03-28 12:45:45,426 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 75.85/44.19 [2019-03-28 12:45:45,426 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 75.85/44.19 [2019-03-28 12:45:45,426 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 75.85/44.19 [2019-03-28 12:45:45,427 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 75.85/44.19 [2019-03-28 12:45:45,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 75.85/44.19 [2019-03-28 12:45:45,465 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 75.85/44.19 [2019-03-28 12:45:45,469 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 75.85/44.19 [2019-03-28 12:45:45,470 INFO L271 PluginConnector]: Initializing CDTParser... 75.85/44.19 [2019-03-28 12:45:45,471 INFO L276 PluginConnector]: CDTParser initialized 75.85/44.19 [2019-03-28 12:45:45,472 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 75.85/44.19 [2019-03-28 12:45:45,536 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/0688b984064c4779993fa1f83de6f6f0/FLAG8a7c8796c 75.85/44.19 [2019-03-28 12:45:45,878 INFO L307 CDTParser]: Found 1 translation units. 75.85/44.19 [2019-03-28 12:45:45,879 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 75.85/44.19 [2019-03-28 12:45:45,879 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 75.85/44.19 [2019-03-28 12:45:45,886 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/0688b984064c4779993fa1f83de6f6f0/FLAG8a7c8796c 75.85/44.19 [2019-03-28 12:45:46,281 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/0688b984064c4779993fa1f83de6f6f0 75.85/44.19 [2019-03-28 12:45:46,294 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 75.85/44.19 [2019-03-28 12:45:46,296 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 75.85/44.19 [2019-03-28 12:45:46,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 75.85/44.19 [2019-03-28 12:45:46,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 75.85/44.19 [2019-03-28 12:45:46,302 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 75.85/44.19 [2019-03-28 12:45:46,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:45:46" (1/1) ... 75.85/44.19 [2019-03-28 12:45:46,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a8c2e1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:46, skipping insertion in model container 75.85/44.19 [2019-03-28 12:45:46,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:45:46" (1/1) ... 75.85/44.19 [2019-03-28 12:45:46,315 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 75.85/44.19 [2019-03-28 12:45:46,333 INFO L176 MainTranslator]: Built tables and reachable declarations 75.85/44.19 [2019-03-28 12:45:46,500 INFO L206 PostProcessor]: Analyzing one entry point: main 75.85/44.19 [2019-03-28 12:45:46,513 INFO L191 MainTranslator]: Completed pre-run 75.85/44.19 [2019-03-28 12:45:46,588 INFO L206 PostProcessor]: Analyzing one entry point: main 75.85/44.19 [2019-03-28 12:45:46,604 INFO L195 MainTranslator]: Completed translation 75.85/44.19 [2019-03-28 12:45:46,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:46 WrapperNode 75.85/44.19 [2019-03-28 12:45:46,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 75.85/44.19 [2019-03-28 12:45:46,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 75.85/44.19 [2019-03-28 12:45:46,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 75.85/44.19 [2019-03-28 12:45:46,605 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 75.85/44.19 [2019-03-28 12:45:46,615 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:45:46" (1/1) ... 75.85/44.19 [2019-03-28 12:45:46,623 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:45:46" (1/1) ... 75.85/44.19 [2019-03-28 12:45:46,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 75.85/44.19 [2019-03-28 12:45:46,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 75.85/44.19 [2019-03-28 12:45:46,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 75.85/44.19 [2019-03-28 12:45:46,646 INFO L276 PluginConnector]: Boogie Preprocessor initialized 75.85/44.19 [2019-03-28 12:45:46,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:46" (1/1) ... 75.85/44.19 [2019-03-28 12:45:46,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:46" (1/1) ... 75.85/44.19 [2019-03-28 12:45:46,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:46" (1/1) ... 75.85/44.19 [2019-03-28 12:45:46,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:46" (1/1) ... 75.85/44.19 [2019-03-28 12:45:46,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:46" (1/1) ... 75.85/44.19 [2019-03-28 12:45:46,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:46" (1/1) ... 75.85/44.19 [2019-03-28 12:45:46,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:46" (1/1) ... 75.85/44.19 [2019-03-28 12:45:46,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 75.85/44.19 [2019-03-28 12:45:46,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 75.85/44.19 [2019-03-28 12:45:46,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... 75.85/44.19 [2019-03-28 12:45:46,671 INFO L276 PluginConnector]: RCFGBuilder initialized 75.85/44.19 [2019-03-28 12:45:46,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:46" (1/1) ... 75.85/44.19 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 75.85/44.19 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 75.85/44.19 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 75.85/44.19 [2019-03-28 12:45:46,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 75.85/44.19 [2019-03-28 12:45:46,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 75.85/44.19 [2019-03-28 12:45:46,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 75.85/44.19 [2019-03-28 12:45:46,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 75.85/44.19 [2019-03-28 12:45:46,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 75.85/44.19 [2019-03-28 12:45:46,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 75.85/44.19 [2019-03-28 12:45:47,015 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 75.85/44.19 [2019-03-28 12:45:47,016 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 75.85/44.19 [2019-03-28 12:45:47,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:47 BoogieIcfgContainer 75.85/44.19 [2019-03-28 12:45:47,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 75.85/44.19 [2019-03-28 12:45:47,018 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 75.85/44.19 [2019-03-28 12:45:47,018 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 75.85/44.19 [2019-03-28 12:45:47,020 INFO L276 PluginConnector]: BlockEncodingV2 initialized 75.85/44.19 [2019-03-28 12:45:47,021 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:47" (1/1) ... 75.85/44.19 [2019-03-28 12:45:47,038 INFO L313 BlockEncoder]: Initial Icfg 43 locations, 46 edges 75.85/44.19 [2019-03-28 12:45:47,040 INFO L258 BlockEncoder]: Using Remove infeasible edges 75.85/44.19 [2019-03-28 12:45:47,040 INFO L263 BlockEncoder]: Using Maximize final states 75.85/44.19 [2019-03-28 12:45:47,041 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 75.85/44.19 [2019-03-28 12:45:47,041 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 75.85/44.19 [2019-03-28 12:45:47,043 INFO L296 BlockEncoder]: Using Remove sink states 75.85/44.19 [2019-03-28 12:45:47,044 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 75.85/44.19 [2019-03-28 12:45:47,044 INFO L179 BlockEncoder]: Using Rewrite not-equals 75.85/44.19 [2019-03-28 12:45:47,068 INFO L185 BlockEncoder]: Using Use SBE 75.85/44.19 [2019-03-28 12:45:47,134 INFO L200 BlockEncoder]: SBE split 24 edges 75.85/44.19 [2019-03-28 12:45:47,140 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 75.85/44.19 [2019-03-28 12:45:47,142 INFO L71 MaximizeFinalStates]: 0 new accepting states 75.85/44.19 [2019-03-28 12:45:47,169 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding 75.85/44.19 [2019-03-28 12:45:47,172 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 75.85/44.19 [2019-03-28 12:45:47,173 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 75.85/44.19 [2019-03-28 12:45:47,174 INFO L71 MaximizeFinalStates]: 0 new accepting states 75.85/44.19 [2019-03-28 12:45:47,174 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 75.85/44.19 [2019-03-28 12:45:47,175 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 75.85/44.19 [2019-03-28 12:45:47,175 INFO L313 BlockEncoder]: Encoded RCFG 37 locations, 93 edges 75.85/44.19 [2019-03-28 12:45:47,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:45:47 BasicIcfg 75.85/44.19 [2019-03-28 12:45:47,176 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 75.85/44.19 [2019-03-28 12:45:47,177 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 75.85/44.19 [2019-03-28 12:45:47,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... 75.85/44.19 [2019-03-28 12:45:47,180 INFO L276 PluginConnector]: TraceAbstraction initialized 75.85/44.19 [2019-03-28 12:45:47,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:45:46" (1/4) ... 75.85/44.19 [2019-03-28 12:45:47,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7298e364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:45:47, skipping insertion in model container 75.85/44.19 [2019-03-28 12:45:47,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:46" (2/4) ... 75.85/44.19 [2019-03-28 12:45:47,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7298e364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:45:47, skipping insertion in model container 75.85/44.19 [2019-03-28 12:45:47,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:47" (3/4) ... 75.85/44.19 [2019-03-28 12:45:47,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7298e364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:45:47, skipping insertion in model container 75.85/44.19 [2019-03-28 12:45:47,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:45:47" (4/4) ... 75.85/44.19 [2019-03-28 12:45:47,184 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 75.85/44.19 [2019-03-28 12:45:47,195 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 75.85/44.19 [2019-03-28 12:45:47,203 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. 75.85/44.19 [2019-03-28 12:45:47,220 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. 75.85/44.19 [2019-03-28 12:45:47,249 INFO L133 ementStrategyFactory]: Using default assertion order modulation 75.85/44.19 [2019-03-28 12:45:47,250 INFO L382 AbstractCegarLoop]: Interprodecural is true 75.85/44.19 [2019-03-28 12:45:47,250 INFO L383 AbstractCegarLoop]: Hoare is true 75.85/44.19 [2019-03-28 12:45:47,250 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 75.85/44.19 [2019-03-28 12:45:47,250 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 75.85/44.19 [2019-03-28 12:45:47,250 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 75.85/44.19 [2019-03-28 12:45:47,250 INFO L387 AbstractCegarLoop]: Difference is false 75.85/44.19 [2019-03-28 12:45:47,251 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 75.85/44.19 [2019-03-28 12:45:47,251 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 75.85/44.19 [2019-03-28 12:45:47,267 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. 75.85/44.19 [2019-03-28 12:45:47,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 75.85/44.19 [2019-03-28 12:45:47,273 INFO L394 BasicCegarLoop]: Found error trace 75.85/44.19 [2019-03-28 12:45:47,274 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 75.85/44.19 [2019-03-28 12:45:47,274 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 75.85/44.19 [2019-03-28 12:45:47,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.19 [2019-03-28 12:45:47,280 INFO L82 PathProgramCache]: Analyzing trace with hash 4215459, now seen corresponding path program 1 times 75.85/44.19 [2019-03-28 12:45:47,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.85/44.19 [2019-03-28 12:45:47,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.85/44.19 [2019-03-28 12:45:47,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:47,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:47,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.19 [2019-03-28 12:45:47,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.85/44.19 [2019-03-28 12:45:47,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 75.85/44.19 [2019-03-28 12:45:47,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 75.85/44.19 [2019-03-28 12:45:47,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 75.85/44.19 [2019-03-28 12:45:47,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 75.85/44.19 [2019-03-28 12:45:47,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 75.85/44.19 [2019-03-28 12:45:47,508 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. 75.85/44.19 [2019-03-28 12:45:47,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 75.85/44.19 [2019-03-28 12:45:47,823 INFO L93 Difference]: Finished difference Result 37 states and 93 transitions. 75.85/44.19 [2019-03-28 12:45:47,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 75.85/44.19 [2019-03-28 12:45:47,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 75.85/44.19 [2019-03-28 12:45:47,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 75.85/44.19 [2019-03-28 12:45:47,857 INFO L225 Difference]: With dead ends: 37 75.85/44.19 [2019-03-28 12:45:47,857 INFO L226 Difference]: Without dead ends: 33 75.85/44.19 [2019-03-28 12:45:47,861 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 75.85/44.19 [2019-03-28 12:45:47,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. 75.85/44.19 [2019-03-28 12:45:47,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. 75.85/44.19 [2019-03-28 12:45:47,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. 75.85/44.19 [2019-03-28 12:45:47,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 85 transitions. 75.85/44.19 [2019-03-28 12:45:47,902 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 85 transitions. Word has length 4 75.85/44.19 [2019-03-28 12:45:47,903 INFO L84 Accepts]: Finished accepts. word is rejected. 75.85/44.19 [2019-03-28 12:45:47,903 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 85 transitions. 75.85/44.19 [2019-03-28 12:45:47,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 75.85/44.19 [2019-03-28 12:45:47,903 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 85 transitions. 75.85/44.19 [2019-03-28 12:45:47,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 75.85/44.19 [2019-03-28 12:45:47,904 INFO L394 BasicCegarLoop]: Found error trace 75.85/44.19 [2019-03-28 12:45:47,904 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 75.85/44.19 [2019-03-28 12:45:47,904 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 75.85/44.19 [2019-03-28 12:45:47,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.19 [2019-03-28 12:45:47,905 INFO L82 PathProgramCache]: Analyzing trace with hash 4215461, now seen corresponding path program 1 times 75.85/44.19 [2019-03-28 12:45:47,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.85/44.19 [2019-03-28 12:45:47,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.85/44.19 [2019-03-28 12:45:47,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:47,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:47,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.19 [2019-03-28 12:45:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.85/44.19 [2019-03-28 12:45:47,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 75.85/44.19 [2019-03-28 12:45:47,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 75.85/44.19 [2019-03-28 12:45:47,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 75.85/44.19 [2019-03-28 12:45:47,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 75.85/44.19 [2019-03-28 12:45:47,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 75.85/44.19 [2019-03-28 12:45:47,939 INFO L87 Difference]: Start difference. First operand 33 states and 85 transitions. Second operand 3 states. 75.85/44.19 [2019-03-28 12:45:48,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 75.85/44.19 [2019-03-28 12:45:48,126 INFO L93 Difference]: Finished difference Result 37 states and 85 transitions. 75.85/44.19 [2019-03-28 12:45:48,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 75.85/44.19 [2019-03-28 12:45:48,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 75.85/44.19 [2019-03-28 12:45:48,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 75.85/44.19 [2019-03-28 12:45:48,128 INFO L225 Difference]: With dead ends: 37 75.85/44.19 [2019-03-28 12:45:48,128 INFO L226 Difference]: Without dead ends: 33 75.85/44.19 [2019-03-28 12:45:48,129 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 75.85/44.19 [2019-03-28 12:45:48,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. 75.85/44.19 [2019-03-28 12:45:48,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. 75.85/44.19 [2019-03-28 12:45:48,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. 75.85/44.19 [2019-03-28 12:45:48,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 81 transitions. 75.85/44.19 [2019-03-28 12:45:48,135 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 81 transitions. Word has length 4 75.85/44.19 [2019-03-28 12:45:48,135 INFO L84 Accepts]: Finished accepts. word is rejected. 75.85/44.19 [2019-03-28 12:45:48,135 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 81 transitions. 75.85/44.19 [2019-03-28 12:45:48,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 75.85/44.19 [2019-03-28 12:45:48,135 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 81 transitions. 75.85/44.19 [2019-03-28 12:45:48,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 75.85/44.19 [2019-03-28 12:45:48,136 INFO L394 BasicCegarLoop]: Found error trace 75.85/44.19 [2019-03-28 12:45:48,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 75.85/44.19 [2019-03-28 12:45:48,136 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 75.85/44.19 [2019-03-28 12:45:48,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.19 [2019-03-28 12:45:48,137 INFO L82 PathProgramCache]: Analyzing trace with hash 4215462, now seen corresponding path program 1 times 75.85/44.19 [2019-03-28 12:45:48,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.85/44.19 [2019-03-28 12:45:48,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.85/44.19 [2019-03-28 12:45:48,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:48,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:48,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.19 [2019-03-28 12:45:48,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.85/44.19 [2019-03-28 12:45:48,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 75.85/44.19 [2019-03-28 12:45:48,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 75.85/44.19 [2019-03-28 12:45:48,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 75.85/44.19 [2019-03-28 12:45:48,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 75.85/44.19 [2019-03-28 12:45:48,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 75.85/44.19 [2019-03-28 12:45:48,192 INFO L87 Difference]: Start difference. First operand 33 states and 81 transitions. Second operand 3 states. 75.85/44.19 [2019-03-28 12:45:48,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 75.85/44.19 [2019-03-28 12:45:48,414 INFO L93 Difference]: Finished difference Result 33 states and 81 transitions. 75.85/44.19 [2019-03-28 12:45:48,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 75.85/44.19 [2019-03-28 12:45:48,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 75.85/44.19 [2019-03-28 12:45:48,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 75.85/44.19 [2019-03-28 12:45:48,416 INFO L225 Difference]: With dead ends: 33 75.85/44.19 [2019-03-28 12:45:48,416 INFO L226 Difference]: Without dead ends: 29 75.85/44.19 [2019-03-28 12:45:48,416 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 75.85/44.19 [2019-03-28 12:45:48,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 75.85/44.19 [2019-03-28 12:45:48,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 75.85/44.19 [2019-03-28 12:45:48,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 75.85/44.19 [2019-03-28 12:45:48,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 77 transitions. 75.85/44.19 [2019-03-28 12:45:48,421 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 77 transitions. Word has length 4 75.85/44.19 [2019-03-28 12:45:48,421 INFO L84 Accepts]: Finished accepts. word is rejected. 75.85/44.19 [2019-03-28 12:45:48,422 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 77 transitions. 75.85/44.19 [2019-03-28 12:45:48,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 75.85/44.19 [2019-03-28 12:45:48,422 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 77 transitions. 75.85/44.19 [2019-03-28 12:45:48,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 75.85/44.19 [2019-03-28 12:45:48,423 INFO L394 BasicCegarLoop]: Found error trace 75.85/44.19 [2019-03-28 12:45:48,423 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 75.85/44.19 [2019-03-28 12:45:48,423 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 75.85/44.19 [2019-03-28 12:45:48,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.19 [2019-03-28 12:45:48,424 INFO L82 PathProgramCache]: Analyzing trace with hash 130676584, now seen corresponding path program 1 times 75.85/44.19 [2019-03-28 12:45:48,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.85/44.19 [2019-03-28 12:45:48,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.85/44.19 [2019-03-28 12:45:48,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:48,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:48,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.19 [2019-03-28 12:45:48,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.85/44.19 [2019-03-28 12:45:48,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 75.85/44.19 [2019-03-28 12:45:48,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 75.85/44.19 [2019-03-28 12:45:48,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 75.85/44.19 [2019-03-28 12:45:48,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 75.85/44.19 [2019-03-28 12:45:48,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 75.85/44.19 [2019-03-28 12:45:48,480 INFO L87 Difference]: Start difference. First operand 29 states and 77 transitions. Second operand 3 states. 75.85/44.19 [2019-03-28 12:45:48,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 75.85/44.19 [2019-03-28 12:45:48,657 INFO L93 Difference]: Finished difference Result 29 states and 77 transitions. 75.85/44.19 [2019-03-28 12:45:48,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 75.85/44.19 [2019-03-28 12:45:48,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 75.85/44.19 [2019-03-28 12:45:48,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 75.85/44.19 [2019-03-28 12:45:48,658 INFO L225 Difference]: With dead ends: 29 75.85/44.19 [2019-03-28 12:45:48,658 INFO L226 Difference]: Without dead ends: 26 75.85/44.19 [2019-03-28 12:45:48,659 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 75.85/44.19 [2019-03-28 12:45:48,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 75.85/44.19 [2019-03-28 12:45:48,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 75.85/44.19 [2019-03-28 12:45:48,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 75.85/44.19 [2019-03-28 12:45:48,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 71 transitions. 75.85/44.19 [2019-03-28 12:45:48,663 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 71 transitions. Word has length 5 75.85/44.19 [2019-03-28 12:45:48,663 INFO L84 Accepts]: Finished accepts. word is rejected. 75.85/44.19 [2019-03-28 12:45:48,663 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 71 transitions. 75.85/44.19 [2019-03-28 12:45:48,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 75.85/44.19 [2019-03-28 12:45:48,663 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 71 transitions. 75.85/44.19 [2019-03-28 12:45:48,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 75.85/44.19 [2019-03-28 12:45:48,664 INFO L394 BasicCegarLoop]: Found error trace 75.85/44.19 [2019-03-28 12:45:48,664 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 75.85/44.19 [2019-03-28 12:45:48,664 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 75.85/44.19 [2019-03-28 12:45:48,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.19 [2019-03-28 12:45:48,665 INFO L82 PathProgramCache]: Analyzing trace with hash 130676586, now seen corresponding path program 1 times 75.85/44.19 [2019-03-28 12:45:48,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.85/44.19 [2019-03-28 12:45:48,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.85/44.19 [2019-03-28 12:45:48,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:48,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:48,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.19 [2019-03-28 12:45:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.85/44.19 [2019-03-28 12:45:48,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 75.85/44.19 [2019-03-28 12:45:48,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 75.85/44.19 [2019-03-28 12:45:48,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 75.85/44.19 [2019-03-28 12:45:48,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 75.85/44.19 [2019-03-28 12:45:48,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 75.85/44.19 [2019-03-28 12:45:48,695 INFO L87 Difference]: Start difference. First operand 26 states and 71 transitions. Second operand 3 states. 75.85/44.19 [2019-03-28 12:45:48,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 75.85/44.19 [2019-03-28 12:45:48,843 INFO L93 Difference]: Finished difference Result 29 states and 71 transitions. 75.85/44.19 [2019-03-28 12:45:48,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 75.85/44.19 [2019-03-28 12:45:48,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 75.85/44.19 [2019-03-28 12:45:48,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 75.85/44.19 [2019-03-28 12:45:48,844 INFO L225 Difference]: With dead ends: 29 75.85/44.19 [2019-03-28 12:45:48,845 INFO L226 Difference]: Without dead ends: 26 75.85/44.19 [2019-03-28 12:45:48,845 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 75.85/44.19 [2019-03-28 12:45:48,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 75.85/44.19 [2019-03-28 12:45:48,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 75.85/44.19 [2019-03-28 12:45:48,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 75.85/44.19 [2019-03-28 12:45:48,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 68 transitions. 75.85/44.19 [2019-03-28 12:45:48,849 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 68 transitions. Word has length 5 75.85/44.19 [2019-03-28 12:45:48,849 INFO L84 Accepts]: Finished accepts. word is rejected. 75.85/44.19 [2019-03-28 12:45:48,849 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 68 transitions. 75.85/44.19 [2019-03-28 12:45:48,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 75.85/44.19 [2019-03-28 12:45:48,849 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 68 transitions. 75.85/44.19 [2019-03-28 12:45:48,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 75.85/44.19 [2019-03-28 12:45:48,850 INFO L394 BasicCegarLoop]: Found error trace 75.85/44.19 [2019-03-28 12:45:48,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 75.85/44.19 [2019-03-28 12:45:48,850 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 75.85/44.19 [2019-03-28 12:45:48,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.19 [2019-03-28 12:45:48,850 INFO L82 PathProgramCache]: Analyzing trace with hash 130676587, now seen corresponding path program 1 times 75.85/44.19 [2019-03-28 12:45:48,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.85/44.19 [2019-03-28 12:45:48,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.85/44.19 [2019-03-28 12:45:48,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:48,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:48,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.19 [2019-03-28 12:45:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.85/44.19 [2019-03-28 12:45:48,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 75.85/44.19 [2019-03-28 12:45:48,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 75.85/44.19 [2019-03-28 12:45:48,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 75.85/44.19 [2019-03-28 12:45:48,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 75.85/44.19 [2019-03-28 12:45:48,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 75.85/44.19 [2019-03-28 12:45:48,902 INFO L87 Difference]: Start difference. First operand 26 states and 68 transitions. Second operand 3 states. 75.85/44.19 [2019-03-28 12:45:49,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 75.85/44.19 [2019-03-28 12:45:49,068 INFO L93 Difference]: Finished difference Result 26 states and 68 transitions. 75.85/44.19 [2019-03-28 12:45:49,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 75.85/44.19 [2019-03-28 12:45:49,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 75.85/44.19 [2019-03-28 12:45:49,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 75.85/44.19 [2019-03-28 12:45:49,069 INFO L225 Difference]: With dead ends: 26 75.85/44.19 [2019-03-28 12:45:49,069 INFO L226 Difference]: Without dead ends: 23 75.85/44.19 [2019-03-28 12:45:49,070 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 75.85/44.19 [2019-03-28 12:45:49,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. 75.85/44.19 [2019-03-28 12:45:49,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. 75.85/44.19 [2019-03-28 12:45:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 75.85/44.19 [2019-03-28 12:45:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 65 transitions. 75.85/44.19 [2019-03-28 12:45:49,073 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 65 transitions. Word has length 5 75.85/44.19 [2019-03-28 12:45:49,073 INFO L84 Accepts]: Finished accepts. word is rejected. 75.85/44.19 [2019-03-28 12:45:49,074 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 65 transitions. 75.85/44.19 [2019-03-28 12:45:49,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 75.85/44.19 [2019-03-28 12:45:49,074 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 65 transitions. 75.85/44.19 [2019-03-28 12:45:49,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 75.85/44.19 [2019-03-28 12:45:49,075 INFO L394 BasicCegarLoop]: Found error trace 75.85/44.19 [2019-03-28 12:45:49,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 75.85/44.19 [2019-03-28 12:45:49,075 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 75.85/44.19 [2019-03-28 12:45:49,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.19 [2019-03-28 12:45:49,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1743744171, now seen corresponding path program 1 times 75.85/44.19 [2019-03-28 12:45:49,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.85/44.19 [2019-03-28 12:45:49,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.85/44.19 [2019-03-28 12:45:49,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:49,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:49,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.19 [2019-03-28 12:45:49,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.85/44.19 [2019-03-28 12:45:49,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 75.85/44.19 [2019-03-28 12:45:49,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 75.85/44.19 [2019-03-28 12:45:49,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 75.85/44.19 [2019-03-28 12:45:49,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 75.85/44.19 [2019-03-28 12:45:49,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 75.85/44.19 [2019-03-28 12:45:49,104 INFO L87 Difference]: Start difference. First operand 23 states and 65 transitions. Second operand 3 states. 75.85/44.19 [2019-03-28 12:45:49,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 75.85/44.19 [2019-03-28 12:45:49,281 INFO L93 Difference]: Finished difference Result 43 states and 95 transitions. 75.85/44.19 [2019-03-28 12:45:49,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 75.85/44.19 [2019-03-28 12:45:49,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 75.85/44.19 [2019-03-28 12:45:49,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 75.85/44.19 [2019-03-28 12:45:49,283 INFO L225 Difference]: With dead ends: 43 75.85/44.19 [2019-03-28 12:45:49,283 INFO L226 Difference]: Without dead ends: 23 75.85/44.19 [2019-03-28 12:45:49,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 75.85/44.19 [2019-03-28 12:45:49,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. 75.85/44.19 [2019-03-28 12:45:49,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. 75.85/44.19 [2019-03-28 12:45:49,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 75.85/44.19 [2019-03-28 12:45:49,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 62 transitions. 75.85/44.19 [2019-03-28 12:45:49,286 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 62 transitions. Word has length 8 75.85/44.19 [2019-03-28 12:45:49,287 INFO L84 Accepts]: Finished accepts. word is rejected. 75.85/44.19 [2019-03-28 12:45:49,287 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 62 transitions. 75.85/44.19 [2019-03-28 12:45:49,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 75.85/44.19 [2019-03-28 12:45:49,287 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 62 transitions. 75.85/44.19 [2019-03-28 12:45:49,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 75.85/44.19 [2019-03-28 12:45:49,287 INFO L394 BasicCegarLoop]: Found error trace 75.85/44.19 [2019-03-28 12:45:49,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 75.85/44.19 [2019-03-28 12:45:49,288 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 75.85/44.19 [2019-03-28 12:45:49,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.19 [2019-03-28 12:45:49,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1743745132, now seen corresponding path program 1 times 75.85/44.19 [2019-03-28 12:45:49,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.85/44.19 [2019-03-28 12:45:49,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.85/44.19 [2019-03-28 12:45:49,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:49,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:49,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.19 [2019-03-28 12:45:49,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.85/44.19 [2019-03-28 12:45:49,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 75.85/44.19 [2019-03-28 12:45:49,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 75.85/44.19 [2019-03-28 12:45:49,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 75.85/44.19 [2019-03-28 12:45:49,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 75.85/44.19 [2019-03-28 12:45:49,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 75.85/44.19 [2019-03-28 12:45:49,327 INFO L87 Difference]: Start difference. First operand 23 states and 62 transitions. Second operand 3 states. 75.85/44.19 [2019-03-28 12:45:49,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 75.85/44.19 [2019-03-28 12:45:49,486 INFO L93 Difference]: Finished difference Result 23 states and 62 transitions. 75.85/44.19 [2019-03-28 12:45:49,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 75.85/44.19 [2019-03-28 12:45:49,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 75.85/44.19 [2019-03-28 12:45:49,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 75.85/44.19 [2019-03-28 12:45:49,487 INFO L225 Difference]: With dead ends: 23 75.85/44.19 [2019-03-28 12:45:49,487 INFO L226 Difference]: Without dead ends: 20 75.85/44.19 [2019-03-28 12:45:49,488 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 75.85/44.19 [2019-03-28 12:45:49,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 75.85/44.19 [2019-03-28 12:45:49,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 75.85/44.19 [2019-03-28 12:45:49,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 75.85/44.19 [2019-03-28 12:45:49,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 56 transitions. 75.85/44.19 [2019-03-28 12:45:49,491 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 56 transitions. Word has length 8 75.85/44.19 [2019-03-28 12:45:49,491 INFO L84 Accepts]: Finished accepts. word is rejected. 75.85/44.19 [2019-03-28 12:45:49,491 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 56 transitions. 75.85/44.19 [2019-03-28 12:45:49,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 75.85/44.19 [2019-03-28 12:45:49,492 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 56 transitions. 75.85/44.19 [2019-03-28 12:45:49,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 75.85/44.19 [2019-03-28 12:45:49,492 INFO L394 BasicCegarLoop]: Found error trace 75.85/44.19 [2019-03-28 12:45:49,492 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 75.85/44.19 [2019-03-28 12:45:49,492 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 75.85/44.19 [2019-03-28 12:45:49,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.19 [2019-03-28 12:45:49,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1743745134, now seen corresponding path program 1 times 75.85/44.19 [2019-03-28 12:45:49,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.85/44.19 [2019-03-28 12:45:49,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.85/44.19 [2019-03-28 12:45:49,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:49,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:49,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.19 [2019-03-28 12:45:49,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.85/44.19 [2019-03-28 12:45:49,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 75.85/44.19 [2019-03-28 12:45:49,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 75.85/44.19 [2019-03-28 12:45:49,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 75.85/44.19 [2019-03-28 12:45:49,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 75.85/44.19 [2019-03-28 12:45:49,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 75.85/44.19 [2019-03-28 12:45:49,524 INFO L87 Difference]: Start difference. First operand 20 states and 56 transitions. Second operand 3 states. 75.85/44.19 [2019-03-28 12:45:49,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 75.85/44.19 [2019-03-28 12:45:49,651 INFO L93 Difference]: Finished difference Result 23 states and 56 transitions. 75.85/44.19 [2019-03-28 12:45:49,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 75.85/44.19 [2019-03-28 12:45:49,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 75.85/44.19 [2019-03-28 12:45:49,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 75.85/44.19 [2019-03-28 12:45:49,652 INFO L225 Difference]: With dead ends: 23 75.85/44.19 [2019-03-28 12:45:49,652 INFO L226 Difference]: Without dead ends: 20 75.85/44.19 [2019-03-28 12:45:49,653 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 75.85/44.19 [2019-03-28 12:45:49,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 75.85/44.19 [2019-03-28 12:45:49,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 75.85/44.19 [2019-03-28 12:45:49,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 75.85/44.19 [2019-03-28 12:45:49,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 53 transitions. 75.85/44.19 [2019-03-28 12:45:49,655 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 53 transitions. Word has length 8 75.85/44.19 [2019-03-28 12:45:49,655 INFO L84 Accepts]: Finished accepts. word is rejected. 75.85/44.19 [2019-03-28 12:45:49,656 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 53 transitions. 75.85/44.19 [2019-03-28 12:45:49,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 75.85/44.19 [2019-03-28 12:45:49,656 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 53 transitions. 75.85/44.19 [2019-03-28 12:45:49,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 75.85/44.19 [2019-03-28 12:45:49,656 INFO L394 BasicCegarLoop]: Found error trace 75.85/44.19 [2019-03-28 12:45:49,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 75.85/44.19 [2019-03-28 12:45:49,657 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 75.85/44.19 [2019-03-28 12:45:49,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.19 [2019-03-28 12:45:49,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1743745135, now seen corresponding path program 1 times 75.85/44.19 [2019-03-28 12:45:49,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.85/44.19 [2019-03-28 12:45:49,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.85/44.19 [2019-03-28 12:45:49,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:49,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:49,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.19 [2019-03-28 12:45:49,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.85/44.19 [2019-03-28 12:45:49,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 75.85/44.19 [2019-03-28 12:45:49,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 75.85/44.19 [2019-03-28 12:45:49,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 75.85/44.19 [2019-03-28 12:45:49,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 75.85/44.19 [2019-03-28 12:45:49,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 75.85/44.19 [2019-03-28 12:45:49,745 INFO L87 Difference]: Start difference. First operand 20 states and 53 transitions. Second operand 4 states. 75.85/44.19 [2019-03-28 12:45:49,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 75.85/44.19 [2019-03-28 12:45:49,920 INFO L93 Difference]: Finished difference Result 20 states and 53 transitions. 75.85/44.19 [2019-03-28 12:45:49,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 75.85/44.19 [2019-03-28 12:45:49,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 75.85/44.19 [2019-03-28 12:45:49,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 75.85/44.19 [2019-03-28 12:45:49,921 INFO L225 Difference]: With dead ends: 20 75.85/44.19 [2019-03-28 12:45:49,922 INFO L226 Difference]: Without dead ends: 0 75.85/44.19 [2019-03-28 12:45:49,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 75.85/44.19 [2019-03-28 12:45:49,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 75.85/44.19 [2019-03-28 12:45:49,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 75.85/44.19 [2019-03-28 12:45:49,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 75.85/44.19 [2019-03-28 12:45:49,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 75.85/44.19 [2019-03-28 12:45:49,923 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 75.85/44.19 [2019-03-28 12:45:49,923 INFO L84 Accepts]: Finished accepts. word is rejected. 75.85/44.19 [2019-03-28 12:45:49,923 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 75.85/44.19 [2019-03-28 12:45:49,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 75.85/44.19 [2019-03-28 12:45:49,924 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 75.85/44.19 [2019-03-28 12:45:49,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 75.85/44.19 [2019-03-28 12:45:49,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 75.85/44.19 [2019-03-28 12:45:49,933 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,933 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,933 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,933 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,933 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,933 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,933 INFO L448 ceAbstractionStarter]: For program point L17-2(line 17) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,934 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,934 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,934 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,934 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,934 INFO L448 ceAbstractionStarter]: For program point L11(lines 11 15) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,934 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,934 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,934 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,934 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,935 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,935 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,935 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,935 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,935 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,935 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,935 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,935 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,936 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,936 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,936 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,936 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,936 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,936 INFO L448 ceAbstractionStarter]: For program point L18-2(line 18) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,936 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,936 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,937 INFO L448 ceAbstractionStarter]: For program point L16-2(line 16) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,937 INFO L448 ceAbstractionStarter]: For program point L16-3(line 16) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,937 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,937 INFO L448 ceAbstractionStarter]: For program point L16-5(lines 16 19) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,937 INFO L448 ceAbstractionStarter]: For program point L16-7(lines 5 21) no Hoare annotation was computed. 75.85/44.19 [2019-03-28 12:45:49,937 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 75.85/44.19 [2019-03-28 12:45:49,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:45:49 BasicIcfg 75.85/44.19 [2019-03-28 12:45:49,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 75.85/44.19 [2019-03-28 12:45:49,940 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 75.85/44.19 [2019-03-28 12:45:49,941 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 75.85/44.19 [2019-03-28 12:45:49,944 INFO L276 PluginConnector]: BuchiAutomizer initialized 75.85/44.19 [2019-03-28 12:45:49,945 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 75.85/44.19 [2019-03-28 12:45:49,945 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:45:46" (1/5) ... 75.85/44.19 [2019-03-28 12:45:49,946 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45618149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:45:49, skipping insertion in model container 75.85/44.19 [2019-03-28 12:45:49,946 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 75.85/44.19 [2019-03-28 12:45:49,946 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:46" (2/5) ... 75.85/44.19 [2019-03-28 12:45:49,946 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45618149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:45:49, skipping insertion in model container 75.85/44.19 [2019-03-28 12:45:49,946 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 75.85/44.19 [2019-03-28 12:45:49,947 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:47" (3/5) ... 75.85/44.19 [2019-03-28 12:45:49,947 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45618149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:45:49, skipping insertion in model container 75.85/44.19 [2019-03-28 12:45:49,947 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 75.85/44.19 [2019-03-28 12:45:49,947 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:45:47" (4/5) ... 75.85/44.19 [2019-03-28 12:45:49,947 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45618149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:45:49, skipping insertion in model container 75.85/44.19 [2019-03-28 12:45:49,947 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 75.85/44.19 [2019-03-28 12:45:49,948 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:45:49" (5/5) ... 75.85/44.19 [2019-03-28 12:45:49,949 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 75.85/44.19 [2019-03-28 12:45:49,970 INFO L133 ementStrategyFactory]: Using default assertion order modulation 75.85/44.19 [2019-03-28 12:45:49,970 INFO L374 BuchiCegarLoop]: Interprodecural is true 75.85/44.19 [2019-03-28 12:45:49,970 INFO L375 BuchiCegarLoop]: Hoare is true 75.85/44.19 [2019-03-28 12:45:49,971 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 75.85/44.19 [2019-03-28 12:45:49,971 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 75.85/44.19 [2019-03-28 12:45:49,971 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 75.85/44.19 [2019-03-28 12:45:49,971 INFO L379 BuchiCegarLoop]: Difference is false 75.85/44.19 [2019-03-28 12:45:49,971 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 75.85/44.19 [2019-03-28 12:45:49,971 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 75.85/44.19 [2019-03-28 12:45:49,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. 75.85/44.19 [2019-03-28 12:45:49,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 75.85/44.19 [2019-03-28 12:45:49,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 75.85/44.19 [2019-03-28 12:45:49,981 INFO L119 BuchiIsEmpty]: Starting construction of run 75.85/44.19 [2019-03-28 12:45:49,985 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 75.85/44.19 [2019-03-28 12:45:49,985 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 75.85/44.19 [2019-03-28 12:45:49,985 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 75.85/44.19 [2019-03-28 12:45:49,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. 75.85/44.19 [2019-03-28 12:45:49,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 75.85/44.19 [2019-03-28 12:45:49,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 75.85/44.19 [2019-03-28 12:45:49,988 INFO L119 BuchiIsEmpty]: Starting construction of run 75.85/44.19 [2019-03-28 12:45:49,988 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 75.85/44.19 [2019-03-28 12:45:49,989 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 75.85/44.19 [2019-03-28 12:45:49,994 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue [106] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 13#L-1true [165] L-1-->L11: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_#t~malloc3.base_1| 1))) (and (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_main_#t~malloc4.base_1| 1)) (< |v_ULTIMATE.start_main_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc4.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~m~0.base_1 |v_ULTIMATE.start_main_#t~malloc3.base_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~m~0.offset_1 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store (store |v_#length_6| |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_#t~malloc3.base_1| 4) |v_ULTIMATE.start_main_#t~malloc4.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_main_#t~malloc4.base_1|)) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (> |v_ULTIMATE.start_main_#t~malloc3.base_1| 0) (= 0 (select .cse3 |v_ULTIMATE.start_main_#t~malloc3.base_1|)) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_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_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_~m~0.base=v_ULTIMATE.start_main_~m~0.base_1, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_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_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~m~0.offset=v_ULTIMATE.start_main_~m~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_~m~0.base, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~m~0.offset, ULTIMATE.start_main_#t~mem6] 35#L11true [167] L11-->L12: Formula: (> 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 18#L12true [81] L12-->L16-7: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~x~0.base_4)) (= (store |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4 1)) |v_#memory_int_1|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_9|} OutVars{#memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_9|} AuxVars[] AssignedVars[#memory_int] 31#L16-7true 75.85/44.19 [2019-03-28 12:45:49,995 INFO L796 eck$LassoCheckResult]: Loop: 31#L16-7true [103] L16-7-->L16: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_11| v_ULTIMATE.start_main_~y~0.base_4)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 6#L16true [180] L16-->L16-1: Formula: (and (not |v_ULTIMATE.start_main_#t~short8_2|) (>= |v_ULTIMATE.start_main_#t~mem6_3| 100)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 3#L16-1true [65] L16-1-->L16-5: Formula: (not |v_ULTIMATE.start_main_#t~short8_5|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_5|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_5|} AuxVars[] AssignedVars[] 15#L16-5true [80] L16-5-->L17: Formula: |v_ULTIMATE.start_main_#t~short8_9| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_9|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short8] 28#L17true [98] L17-->L17-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~y~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 25#L17-1true [95] L17-1-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem10_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, #valid=|v_#valid_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 24#L17-2true [215] L17-2-->L18: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem10_6| |v_ULTIMATE.start_main_#t~mem9_6|))) |v_#memory_int_15|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_27| v_ULTIMATE.start_main_~y~0.base_13)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_13)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_27|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem9, #memory_int] 10#L18true [74] L18-->L18-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_21| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~z~0.base_7)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6)) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_11|, #length=|v_#length_21|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 9#L18-1true [71] L18-1-->L18-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_23| v_ULTIMATE.start_main_~x~0.base_13)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10) (= (select |v_#valid_25| v_ULTIMATE.start_main_~x~0.base_13) 1) (= |v_ULTIMATE.start_main_#t~mem12_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_25|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 7#L18-2true [216] L18-2-->L16-7: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_10 4) (select |v_#length_28| v_ULTIMATE.start_main_~z~0.base_13)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_10) (= (select |v_#valid_42| v_ULTIMATE.start_main_~z~0.base_13) 1) (= |v_#memory_int_17| (store |v_#memory_int_18| v_ULTIMATE.start_main_~z~0.base_13 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~z~0.base_13) v_ULTIMATE.start_main_~z~0.offset_10 (+ (* (- 1) |v_ULTIMATE.start_main_#t~mem12_6|) |v_ULTIMATE.start_main_#t~mem11_6|))))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_13, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_13, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, #memory_int] 31#L16-7true 75.85/44.19 [2019-03-28 12:45:49,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.19 [2019-03-28 12:45:49,996 INFO L82 PathProgramCache]: Analyzing trace with hash 4245190, now seen corresponding path program 1 times 75.85/44.19 [2019-03-28 12:45:49,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.85/44.19 [2019-03-28 12:45:49,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.85/44.19 [2019-03-28 12:45:49,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:49,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:49,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.19 [2019-03-28 12:45:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.19 [2019-03-28 12:45:50,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.19 [2019-03-28 12:45:50,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1283019618, now seen corresponding path program 1 times 75.85/44.19 [2019-03-28 12:45:50,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.85/44.19 [2019-03-28 12:45:50,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.85/44.19 [2019-03-28 12:45:50,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:50,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:50,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.19 [2019-03-28 12:45:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.19 [2019-03-28 12:45:50,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.85/44.19 [2019-03-28 12:45:50,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 75.85/44.19 [2019-03-28 12:45:50,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 75.85/44.19 [2019-03-28 12:45:50,050 INFO L811 eck$LassoCheckResult]: loop already infeasible 75.85/44.19 [2019-03-28 12:45:50,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 75.85/44.19 [2019-03-28 12:45:50,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 75.85/44.19 [2019-03-28 12:45:50,052 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. 75.85/44.19 [2019-03-28 12:45:50,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 75.85/44.19 [2019-03-28 12:45:50,264 INFO L93 Difference]: Finished difference Result 39 states and 94 transitions. 75.85/44.19 [2019-03-28 12:45:50,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 75.85/44.19 [2019-03-28 12:45:50,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 94 transitions. 75.85/44.19 [2019-03-28 12:45:50,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 75.85/44.19 [2019-03-28 12:45:50,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 17 states and 50 transitions. 75.85/44.19 [2019-03-28 12:45:50,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 75.85/44.19 [2019-03-28 12:45:50,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 75.85/44.19 [2019-03-28 12:45:50,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 50 transitions. 75.85/44.19 [2019-03-28 12:45:50,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 75.85/44.19 [2019-03-28 12:45:50,272 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 50 transitions. 75.85/44.19 [2019-03-28 12:45:50,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 50 transitions. 75.85/44.19 [2019-03-28 12:45:50,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 75.85/44.19 [2019-03-28 12:45:50,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 75.85/44.19 [2019-03-28 12:45:50,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 50 transitions. 75.85/44.19 [2019-03-28 12:45:50,275 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 50 transitions. 75.85/44.19 [2019-03-28 12:45:50,275 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 50 transitions. 75.85/44.19 [2019-03-28 12:45:50,275 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 75.85/44.19 [2019-03-28 12:45:50,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 50 transitions. 75.85/44.19 [2019-03-28 12:45:50,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 75.85/44.19 [2019-03-28 12:45:50,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 75.85/44.19 [2019-03-28 12:45:50,277 INFO L119 BuchiIsEmpty]: Starting construction of run 75.85/44.19 [2019-03-28 12:45:50,277 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 75.85/44.19 [2019-03-28 12:45:50,277 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 75.85/44.19 [2019-03-28 12:45:50,278 INFO L794 eck$LassoCheckResult]: Stem: 97#ULTIMATE.startENTRY [106] 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] 95#L-1 [165] L-1-->L11: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_#t~malloc3.base_1| 1))) (and (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_main_#t~malloc4.base_1| 1)) (< |v_ULTIMATE.start_main_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc4.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~m~0.base_1 |v_ULTIMATE.start_main_#t~malloc3.base_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~m~0.offset_1 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store (store |v_#length_6| |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_#t~malloc3.base_1| 4) |v_ULTIMATE.start_main_#t~malloc4.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_main_#t~malloc4.base_1|)) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (> |v_ULTIMATE.start_main_#t~malloc3.base_1| 0) (= 0 (select .cse3 |v_ULTIMATE.start_main_#t~malloc3.base_1|)) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_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_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_~m~0.base=v_ULTIMATE.start_main_~m~0.base_1, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_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_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~m~0.offset=v_ULTIMATE.start_main_~m~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_~m~0.base, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~m~0.offset, ULTIMATE.start_main_#t~mem6] 96#L11 [167] L11-->L12: Formula: (> 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 99#L12 [81] L12-->L16-7: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~x~0.base_4)) (= (store |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4 1)) |v_#memory_int_1|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_9|} OutVars{#memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_9|} AuxVars[] AssignedVars[#memory_int] 91#L16-7 75.85/44.19 [2019-03-28 12:45:50,278 INFO L796 eck$LassoCheckResult]: Loop: 91#L16-7 [103] L16-7-->L16: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_11| v_ULTIMATE.start_main_~y~0.base_4)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 92#L16 [181] L16-->L16-1: Formula: (and (< |v_ULTIMATE.start_main_#t~mem6_3| 100) |v_ULTIMATE.start_main_#t~short8_2|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 87#L16-1 [64] L16-1-->L16-2: Formula: |v_ULTIMATE.start_main_#t~short8_3| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} AuxVars[] AssignedVars[] 88#L16-2 [89] L16-2-->L16-3: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~z~0.base_4)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_4 4) (select |v_#length_13| v_ULTIMATE.start_main_~z~0.base_4)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~z~0.base_4) v_ULTIMATE.start_main_~z~0.offset_4))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_4, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_4, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_4, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_4, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 101#L16-3 [187] L16-3-->L16-5: Formula: (and |v_ULTIMATE.start_main_#t~short8_4| (< |v_ULTIMATE.start_main_#t~mem7_3| 100)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_4|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 98#L16-5 [80] L16-5-->L17: Formula: |v_ULTIMATE.start_main_#t~short8_9| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_9|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short8] 93#L17 [98] L17-->L17-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~y~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 89#L17-1 [95] L17-1-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem10_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, #valid=|v_#valid_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 85#L17-2 [215] L17-2-->L18: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem10_6| |v_ULTIMATE.start_main_#t~mem9_6|))) |v_#memory_int_15|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_27| v_ULTIMATE.start_main_~y~0.base_13)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_13)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_27|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem9, #memory_int] 86#L18 [74] L18-->L18-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_21| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~z~0.base_7)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6)) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_11|, #length=|v_#length_21|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 94#L18-1 [71] L18-1-->L18-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_23| v_ULTIMATE.start_main_~x~0.base_13)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10) (= (select |v_#valid_25| v_ULTIMATE.start_main_~x~0.base_13) 1) (= |v_ULTIMATE.start_main_#t~mem12_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_25|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 90#L18-2 [216] L18-2-->L16-7: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_10 4) (select |v_#length_28| v_ULTIMATE.start_main_~z~0.base_13)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_10) (= (select |v_#valid_42| v_ULTIMATE.start_main_~z~0.base_13) 1) (= |v_#memory_int_17| (store |v_#memory_int_18| v_ULTIMATE.start_main_~z~0.base_13 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~z~0.base_13) v_ULTIMATE.start_main_~z~0.offset_10 (+ (* (- 1) |v_ULTIMATE.start_main_#t~mem12_6|) |v_ULTIMATE.start_main_#t~mem11_6|))))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_13, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_13, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, #memory_int] 91#L16-7 75.85/44.20 [2019-03-28 12:45:50,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.20 [2019-03-28 12:45:50,279 INFO L82 PathProgramCache]: Analyzing trace with hash 4245190, now seen corresponding path program 2 times 75.85/44.20 [2019-03-28 12:45:50,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.85/44.20 [2019-03-28 12:45:50,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.85/44.20 [2019-03-28 12:45:50,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:45:50,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:45:50,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:45:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:45:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:45:50,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.20 [2019-03-28 12:45:50,301 INFO L82 PathProgramCache]: Analyzing trace with hash 18652478, now seen corresponding path program 1 times 75.85/44.20 [2019-03-28 12:45:50,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.85/44.20 [2019-03-28 12:45:50,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.85/44.20 [2019-03-28 12:45:50,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:45:50,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:45:50,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:45:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:45:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:45:50,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.20 [2019-03-28 12:45:50,341 INFO L82 PathProgramCache]: Analyzing trace with hash -2093456253, now seen corresponding path program 1 times 75.85/44.20 [2019-03-28 12:45:50,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.85/44.20 [2019-03-28 12:45:50,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.85/44.20 [2019-03-28 12:45:50,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:45:50,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:45:50,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:45:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:45:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:45:51,040 WARN L188 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 75.85/44.20 [2019-03-28 12:45:51,233 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 85 75.85/44.20 [2019-03-28 12:45:51,247 INFO L216 LassoAnalysis]: Preferences: 75.85/44.20 [2019-03-28 12:45:51,249 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 75.85/44.20 [2019-03-28 12:45:51,249 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 75.85/44.20 [2019-03-28 12:45:51,249 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 75.85/44.20 [2019-03-28 12:45:51,249 INFO L127 ssoRankerPreferences]: Use exernal solver: false 75.85/44.20 [2019-03-28 12:45:51,250 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 75.85/44.20 [2019-03-28 12:45:51,250 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 75.85/44.20 [2019-03-28 12:45:51,250 INFO L130 ssoRankerPreferences]: Path of dumped script: 75.85/44.20 [2019-03-28 12:45:51,250 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 75.85/44.20 [2019-03-28 12:45:51,250 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 75.85/44.20 [2019-03-28 12:45:51,250 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 75.85/44.20 [2019-03-28 12:45:51,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:45:51,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:45:51,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:45:51,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:45:51,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:45:51,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:45:51,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:45:51,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:45:51,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:45:51,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:45:51,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:45:51,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:45:51,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:45:51,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:45:51,718 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 75.85/44.20 [2019-03-28 12:45:51,828 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 75.85/44.20 [2019-03-28 12:45:52,242 INFO L300 LassoAnalysis]: Preprocessing complete. 75.85/44.20 [2019-03-28 12:45:52,247 INFO L497 LassoAnalysis]: Using template 'affine'. 75.85/44.20 [2019-03-28 12:45:52,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:45:52,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:45:52,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.85/44.20 [2019-03-28 12:45:52,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:45:52,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:45:52,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:45:52,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:45:52,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.85/44.20 [2019-03-28 12:45:52,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:45:52,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:45:52,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:45:52,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.85/44.20 [2019-03-28 12:45:52,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:45:52,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:45:52,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:45:52,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:45:52,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.85/44.20 [2019-03-28 12:45:52,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:45:52,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:45:52,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:45:52,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.85/44.20 [2019-03-28 12:45:52,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:45:52,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:45:52,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:45:52,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:45:52,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.85/44.20 [2019-03-28 12:45:52,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:45:52,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:45:52,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:45:52,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:45:52,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:45:52,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:45:52,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:45:52,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:45:52,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:45:52,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:45:52,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:45:52,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:45:52,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:45:52,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:45:52,273 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:45:52,273 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:45:52,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:45:52,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:45:52,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:45:52,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.85/44.20 [2019-03-28 12:45:52,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:45:52,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:45:52,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:45:52,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:45:52,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.85/44.20 [2019-03-28 12:45:52,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:45:52,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:45:52,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:45:52,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.85/44.20 [2019-03-28 12:45:52,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:45:52,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:45:52,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:45:52,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:45:52,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.85/44.20 [2019-03-28 12:45:52,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:45:52,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:45:52,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:45:52,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:45:52,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:45:52,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:45:52,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:45:52,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:45:52,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:45:52,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:45:52,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:45:52,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:45:52,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:45:52,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:45:52,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:45:52,290 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:45:52,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:45:52,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:45:52,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:45:52,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.85/44.20 [2019-03-28 12:45:52,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:45:52,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:45:52,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:45:52,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:45:52,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.85/44.20 [2019-03-28 12:45:52,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:45:52,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:45:52,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:45:52,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.85/44.20 [2019-03-28 12:45:52,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:45:52,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:45:52,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:45:52,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:45:52,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.85/44.20 [2019-03-28 12:45:52,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:45:52,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:45:52,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:45:52,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.85/44.20 [2019-03-28 12:45:52,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:45:52,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:45:52,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:45:52,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:45:52,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.85/44.20 [2019-03-28 12:45:52,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:45:52,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:45:52,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:45:52,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.85/44.20 [2019-03-28 12:45:52,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:45:52,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:45:52,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:45:52,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:45:52,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.85/44.20 [2019-03-28 12:45:52,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:45:52,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:45:52,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:45:52,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:45:52,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:45:52,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:45:52,306 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:45:52,306 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:45:52,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:45:52,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:45:52,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:45:52,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:45:52,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:45:52,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:45:52,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:45:52,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:45:52,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:45:52,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:45:52,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:45:52,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:45:52,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:45:52,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:45:52,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:45:52,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:45:52,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:45:52,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:45:52,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:45:52,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:45:52,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:45:52,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:45:52,329 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:45:52,329 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:45:52,343 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 75.85/44.20 [2019-03-28 12:45:52,351 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 75.85/44.20 [2019-03-28 12:45:52,352 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. 75.85/44.20 [2019-03-28 12:45:52,354 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 75.85/44.20 [2019-03-28 12:45:52,355 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 75.85/44.20 [2019-03-28 12:45:52,356 INFO L518 LassoAnalysis]: Proved termination. 75.85/44.20 [2019-03-28 12:45:52,356 INFO L520 LassoAnalysis]: Termination argument consisting of: 75.85/44.20 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 + 199 75.85/44.20 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 - 1 >= 0] 75.85/44.20 [2019-03-28 12:45:52,512 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed 75.85/44.20 [2019-03-28 12:45:52,527 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 75.85/44.20 [2019-03-28 12:45:52,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.20 [2019-03-28 12:45:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.20 [2019-03-28 12:45:52,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core 75.85/44.20 [2019-03-28 12:45:52,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.85/44.20 [2019-03-28 12:45:52,617 INFO L189 IndexEqualityManager]: detected not equals via solver 75.85/44.20 [2019-03-28 12:45:52,633 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 75.85/44.20 [2019-03-28 12:45:52,634 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:45:52,646 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:45:52,647 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:45:52,647 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 75.85/44.20 [2019-03-28 12:45:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.20 [2019-03-28 12:45:52,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core 75.85/44.20 [2019-03-28 12:45:52,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.85/44.20 [2019-03-28 12:45:52,838 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:45:52,839 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 2 case distinctions, treesize of input 53 treesize of output 74 75.85/44.20 [2019-03-28 12:45:52,854 INFO L427 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 75.85/44.20 [2019-03-28 12:45:52,951 INFO L497 ElimStorePlain]: treesize reduction 52, result has 62.0 percent of original size 75.85/44.20 [2019-03-28 12:45:52,955 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 1 xjuncts. 75.85/44.20 [2019-03-28 12:45:52,955 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:81 75.85/44.20 [2019-03-28 12:45:53,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.85/44.20 [2019-03-28 12:45:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.20 [2019-03-28 12:45:53,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core 75.85/44.20 [2019-03-28 12:45:53,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.85/44.20 [2019-03-28 12:45:53,697 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:45:53,698 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 2 case distinctions, treesize of input 46 treesize of output 71 75.85/44.20 [2019-03-28 12:45:53,708 INFO L427 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 75.85/44.20 [2019-03-28 12:45:53,789 INFO L497 ElimStorePlain]: treesize reduction 49, result has 61.7 percent of original size 75.85/44.20 [2019-03-28 12:45:53,792 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 1 xjuncts. 75.85/44.20 [2019-03-28 12:45:53,793 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:75 75.85/44.20 [2019-03-28 12:45:54,003 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 52 treesize of output 51 75.85/44.20 [2019-03-28 12:45:54,004 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:45:54,021 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:45:54,022 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 56 75.85/44.20 [2019-03-28 12:45:54,023 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:45:54,035 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 75.85/44.20 [2019-03-28 12:45:54,035 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:45:54,156 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 75.85/44.20 [2019-03-28 12:45:54,156 INFO L497 ElimStorePlain]: treesize reduction 4, result has 97.5 percent of original size 75.85/44.20 [2019-03-28 12:45:54,158 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. 75.85/44.20 [2019-03-28 12:45:54,158 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:169, output treesize:120 75.85/44.20 [2019-03-28 12:45:54,364 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 75.85/44.20 [2019-03-28 12:45:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:45:55,429 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 75.85/44.20 [2019-03-28 12:45:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:45:55,441 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 75.85/44.20 [2019-03-28 12:45:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.20 [2019-03-28 12:45:55,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core 75.85/44.20 [2019-03-28 12:45:55,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.85/44.20 [2019-03-28 12:45:55,473 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:45:55,474 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 34 treesize of output 48 75.85/44.20 [2019-03-28 12:45:55,475 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:45:55,511 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size 75.85/44.20 [2019-03-28 12:45:55,511 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:45:55,512 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:30 75.85/44.20 [2019-03-28 12:45:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.20 [2019-03-28 12:45:55,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core 75.85/44.20 [2019-03-28 12:45:55,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.85/44.20 [2019-03-28 12:45:55,557 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:45:55,557 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 34 treesize of output 48 75.85/44.20 [2019-03-28 12:45:55,558 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:45:55,593 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size 75.85/44.20 [2019-03-28 12:45:55,594 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:45:55,595 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:30 75.85/44.20 [2019-03-28 12:45:55,632 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:45:55,633 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 2 case distinctions, treesize of input 53 treesize of output 74 75.85/44.20 [2019-03-28 12:45:55,640 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 75.85/44.20 [2019-03-28 12:45:55,744 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 75.85/44.20 [2019-03-28 12:45:55,745 INFO L497 ElimStorePlain]: treesize reduction 29, result has 76.4 percent of original size 75.85/44.20 [2019-03-28 12:45:55,748 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 1 xjuncts. 75.85/44.20 [2019-03-28 12:45:55,748 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:90 75.85/44.20 [2019-03-28 12:45:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.20 [2019-03-28 12:45:55,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core 75.85/44.20 [2019-03-28 12:45:55,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.85/44.20 [2019-03-28 12:45:55,826 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:45:55,827 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 34 treesize of output 48 75.85/44.20 [2019-03-28 12:45:55,828 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:45:55,859 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size 75.85/44.20 [2019-03-28 12:45:55,860 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:45:55,860 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:30 75.85/44.20 [2019-03-28 12:45:55,907 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:45:55,908 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 2 case distinctions, treesize of input 53 treesize of output 74 75.85/44.20 [2019-03-28 12:45:55,913 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 75.85/44.20 [2019-03-28 12:45:55,988 INFO L497 ElimStorePlain]: treesize reduction 18, result has 78.8 percent of original size 75.85/44.20 [2019-03-28 12:45:55,992 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 1 xjuncts. 75.85/44.20 [2019-03-28 12:45:55,992 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:61 75.85/44.20 [2019-03-28 12:45:56,078 INFO L98 LoopCannibalizer]: 16 predicates before loop cannibalization 28 predicates after loop cannibalization 75.85/44.20 [2019-03-28 12:45:56,083 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 28 loop predicates 75.85/44.20 [2019-03-28 12:45:56,084 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 50 transitions. cyclomatic complexity: 34 Second operand 8 states. 75.85/44.20 [2019-03-28 12:45:59,049 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 75.85/44.20 [2019-03-28 12:45:59,606 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 75.85/44.20 [2019-03-28 12:46:00,074 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 50 transitions. cyclomatic complexity: 34. Second operand 8 states. Result 351 states and 394 transitions. Complement of second has 171 states. 75.85/44.20 [2019-03-28 12:46:00,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 38 states 5 stem states 31 non-accepting loop states 2 accepting loop states 75.85/44.20 [2019-03-28 12:46:00,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 75.85/44.20 [2019-03-28 12:46:00,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 163 transitions. 75.85/44.20 [2019-03-28 12:46:00,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 163 transitions. Stem has 4 letters. Loop has 12 letters. 75.85/44.20 [2019-03-28 12:46:00,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.85/44.20 [2019-03-28 12:46:00,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 163 transitions. Stem has 16 letters. Loop has 12 letters. 75.85/44.20 [2019-03-28 12:46:00,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.85/44.20 [2019-03-28 12:46:00,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 163 transitions. Stem has 4 letters. Loop has 24 letters. 75.85/44.20 [2019-03-28 12:46:00,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.85/44.20 [2019-03-28 12:46:00,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 351 states and 394 transitions. 75.85/44.20 [2019-03-28 12:46:00,104 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 84 75.85/44.20 [2019-03-28 12:46:00,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 351 states to 196 states and 233 transitions. 75.85/44.20 [2019-03-28 12:46:00,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 166 75.85/44.20 [2019-03-28 12:46:00,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 196 75.85/44.20 [2019-03-28 12:46:00,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 233 transitions. 75.85/44.20 [2019-03-28 12:46:00,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 75.85/44.20 [2019-03-28 12:46:00,108 INFO L706 BuchiCegarLoop]: Abstraction has 196 states and 233 transitions. 75.85/44.20 [2019-03-28 12:46:00,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 233 transitions. 75.85/44.20 [2019-03-28 12:46:00,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 18. 75.85/44.20 [2019-03-28 12:46:00,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 75.85/44.20 [2019-03-28 12:46:00,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 51 transitions. 75.85/44.20 [2019-03-28 12:46:00,112 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 51 transitions. 75.85/44.20 [2019-03-28 12:46:00,112 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 51 transitions. 75.85/44.20 [2019-03-28 12:46:00,112 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 75.85/44.20 [2019-03-28 12:46:00,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 51 transitions. 75.85/44.20 [2019-03-28 12:46:00,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 75.85/44.20 [2019-03-28 12:46:00,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 75.85/44.20 [2019-03-28 12:46:00,113 INFO L119 BuchiIsEmpty]: Starting construction of run 75.85/44.20 [2019-03-28 12:46:00,114 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 75.85/44.20 [2019-03-28 12:46:00,114 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 75.85/44.20 [2019-03-28 12:46:00,115 INFO L794 eck$LassoCheckResult]: Stem: 1106#ULTIMATE.startENTRY [106] 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] 1103#L-1 [158] L-1-->L11: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_#t~malloc3.base_1| 1))) (and (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc3.base_1| 0) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_main_#t~malloc4.base_1| 1)) (< |v_ULTIMATE.start_main_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc4.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~m~0.base_1 |v_ULTIMATE.start_main_#t~malloc3.base_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~m~0.offset_1 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store (store |v_#length_6| |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_#t~malloc3.base_1| 4) |v_ULTIMATE.start_main_#t~malloc4.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_main_#t~malloc4.base_1|)) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= 0 (select .cse3 |v_ULTIMATE.start_main_#t~malloc3.base_1|)) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_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_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_~m~0.base=v_ULTIMATE.start_main_~m~0.base_1, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_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_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~m~0.offset=v_ULTIMATE.start_main_~m~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_~m~0.base, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~m~0.offset, ULTIMATE.start_main_#t~mem6] 1104#L11 [167] L11-->L12: Formula: (> 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 1109#L12 [81] L12-->L16-7: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~x~0.base_4)) (= (store |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4 1)) |v_#memory_int_1|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_9|} OutVars{#memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_9|} AuxVars[] AssignedVars[#memory_int] 1100#L16-7 75.85/44.20 [2019-03-28 12:46:00,115 INFO L796 eck$LassoCheckResult]: Loop: 1100#L16-7 [103] L16-7-->L16: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_11| v_ULTIMATE.start_main_~y~0.base_4)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 1097#L16 [181] L16-->L16-1: Formula: (and (< |v_ULTIMATE.start_main_#t~mem6_3| 100) |v_ULTIMATE.start_main_#t~short8_2|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 1093#L16-1 [64] L16-1-->L16-2: Formula: |v_ULTIMATE.start_main_#t~short8_3| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} AuxVars[] AssignedVars[] 1094#L16-2 [89] L16-2-->L16-3: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~z~0.base_4)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_4 4) (select |v_#length_13| v_ULTIMATE.start_main_~z~0.base_4)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~z~0.base_4) v_ULTIMATE.start_main_~z~0.offset_4))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_4, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_4, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_4, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_4, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 1110#L16-3 [187] L16-3-->L16-5: Formula: (and |v_ULTIMATE.start_main_#t~short8_4| (< |v_ULTIMATE.start_main_#t~mem7_3| 100)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_4|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 1108#L16-5 [80] L16-5-->L17: Formula: |v_ULTIMATE.start_main_#t~short8_9| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_9|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short8] 1101#L17 [98] L17-->L17-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~y~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 1098#L17-1 [95] L17-1-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem10_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, #valid=|v_#valid_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 1095#L17-2 [215] L17-2-->L18: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem10_6| |v_ULTIMATE.start_main_#t~mem9_6|))) |v_#memory_int_15|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_27| v_ULTIMATE.start_main_~y~0.base_13)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_13)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_27|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem9, #memory_int] 1096#L18 [74] L18-->L18-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_21| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~z~0.base_7)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6)) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_11|, #length=|v_#length_21|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 1102#L18-1 [71] L18-1-->L18-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_23| v_ULTIMATE.start_main_~x~0.base_13)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10) (= (select |v_#valid_25| v_ULTIMATE.start_main_~x~0.base_13) 1) (= |v_ULTIMATE.start_main_#t~mem12_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_25|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 1099#L18-2 [216] L18-2-->L16-7: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_10 4) (select |v_#length_28| v_ULTIMATE.start_main_~z~0.base_13)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_10) (= (select |v_#valid_42| v_ULTIMATE.start_main_~z~0.base_13) 1) (= |v_#memory_int_17| (store |v_#memory_int_18| v_ULTIMATE.start_main_~z~0.base_13 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~z~0.base_13) v_ULTIMATE.start_main_~z~0.offset_10 (+ (* (- 1) |v_ULTIMATE.start_main_#t~mem12_6|) |v_ULTIMATE.start_main_#t~mem11_6|))))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_13, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_13, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, #memory_int] 1100#L16-7 75.85/44.20 [2019-03-28 12:46:00,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.20 [2019-03-28 12:46:00,116 INFO L82 PathProgramCache]: Analyzing trace with hash 4238463, now seen corresponding path program 1 times 75.85/44.20 [2019-03-28 12:46:00,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.85/44.20 [2019-03-28 12:46:00,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.85/44.20 [2019-03-28 12:46:00,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:00,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:00,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:00,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.20 [2019-03-28 12:46:00,136 INFO L82 PathProgramCache]: Analyzing trace with hash 18652478, now seen corresponding path program 2 times 75.85/44.20 [2019-03-28 12:46:00,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.85/44.20 [2019-03-28 12:46:00,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.85/44.20 [2019-03-28 12:46:00,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:00,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:00,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:00,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.20 [2019-03-28 12:46:00,163 INFO L82 PathProgramCache]: Analyzing trace with hash 238582972, now seen corresponding path program 1 times 75.85/44.20 [2019-03-28 12:46:00,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.85/44.20 [2019-03-28 12:46:00,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.85/44.20 [2019-03-28 12:46:00,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:00,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:00,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:00,707 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 75.85/44.20 [2019-03-28 12:46:00,871 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 88 75.85/44.20 [2019-03-28 12:46:00,875 INFO L216 LassoAnalysis]: Preferences: 75.85/44.20 [2019-03-28 12:46:00,875 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 75.85/44.20 [2019-03-28 12:46:00,876 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 75.85/44.20 [2019-03-28 12:46:00,876 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 75.85/44.20 [2019-03-28 12:46:00,876 INFO L127 ssoRankerPreferences]: Use exernal solver: false 75.85/44.20 [2019-03-28 12:46:00,876 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 75.85/44.20 [2019-03-28 12:46:00,876 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 75.85/44.20 [2019-03-28 12:46:00,876 INFO L130 ssoRankerPreferences]: Path of dumped script: 75.85/44.20 [2019-03-28 12:46:00,876 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 75.85/44.20 [2019-03-28 12:46:00,876 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 75.85/44.20 [2019-03-28 12:46:00,877 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 75.85/44.20 [2019-03-28 12:46:00,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:00,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:00,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:01,277 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 75.85/44.20 [2019-03-28 12:46:01,394 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 75.85/44.20 [2019-03-28 12:46:01,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:01,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:01,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:01,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:01,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:01,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:01,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:01,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:01,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:01,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:01,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:01,560 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 75.85/44.20 [2019-03-28 12:46:01,880 INFO L300 LassoAnalysis]: Preprocessing complete. 75.85/44.20 [2019-03-28 12:46:01,880 INFO L497 LassoAnalysis]: Using template 'affine'. 75.85/44.20 [2019-03-28 12:46:01,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:01,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:01,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.85/44.20 [2019-03-28 12:46:01,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:01,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:01,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:01,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:01,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:01,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:01,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:01,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:01,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:01,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:01,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:01,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:01,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:01,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:01,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:01,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:01,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:01,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:01,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:01,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:01,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:01,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:01,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:01,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:01,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:01,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:01,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:01,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:01,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:01,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:01,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:01,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:01,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:01,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:01,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:01,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:01,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:01,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:01,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:01,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:01,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:01,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:01,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:01,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:01,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:01,936 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 75.85/44.20 [2019-03-28 12:46:01,940 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 75.85/44.20 [2019-03-28 12:46:01,940 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. 75.85/44.20 [2019-03-28 12:46:01,941 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 75.85/44.20 [2019-03-28 12:46:01,941 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 75.85/44.20 [2019-03-28 12:46:01,942 INFO L518 LassoAnalysis]: Proved termination. 75.85/44.20 [2019-03-28 12:46:01,942 INFO L520 LassoAnalysis]: Termination argument consisting of: 75.85/44.20 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 + 199 75.85/44.20 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 - 1 >= 0] 75.85/44.20 [2019-03-28 12:46:02,102 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed 75.85/44.20 [2019-03-28 12:46:02,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 75.85/44.20 [2019-03-28 12:46:02,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.20 [2019-03-28 12:46:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.20 [2019-03-28 12:46:02,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 18 conjunts are in the unsatisfiable core 75.85/44.20 [2019-03-28 12:46:02,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.85/44.20 [2019-03-28 12:46:02,155 INFO L189 IndexEqualityManager]: detected not equals via solver 75.85/44.20 [2019-03-28 12:46:02,156 INFO L189 IndexEqualityManager]: detected not equals via solver 75.85/44.20 [2019-03-28 12:46:02,161 INFO L189 IndexEqualityManager]: detected not equals via solver 75.85/44.20 [2019-03-28 12:46:02,162 INFO L189 IndexEqualityManager]: detected not equals via solver 75.85/44.20 [2019-03-28 12:46:02,167 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:46:02,167 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 32 treesize of output 34 75.85/44.20 [2019-03-28 12:46:02,168 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:02,182 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:46:02,183 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:02,183 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:23 75.85/44.20 [2019-03-28 12:46:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.20 [2019-03-28 12:46:02,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core 75.85/44.20 [2019-03-28 12:46:02,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.85/44.20 [2019-03-28 12:46:02,346 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:46:02,347 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 2 case distinctions, treesize of input 53 treesize of output 74 75.85/44.20 [2019-03-28 12:46:02,353 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:02,474 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 75.85/44.20 [2019-03-28 12:46:02,475 INFO L497 ElimStorePlain]: treesize reduction 29, result has 76.4 percent of original size 75.85/44.20 [2019-03-28 12:46:02,477 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 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:02,478 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:90 75.85/44.20 [2019-03-28 12:46:02,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.85/44.20 [2019-03-28 12:46:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.20 [2019-03-28 12:46:02,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core 75.85/44.20 [2019-03-28 12:46:02,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.85/44.20 [2019-03-28 12:46:03,080 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:46:03,081 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 2 case distinctions, treesize of input 46 treesize of output 71 75.85/44.20 [2019-03-28 12:46:03,087 INFO L427 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:03,167 INFO L497 ElimStorePlain]: treesize reduction 49, result has 61.7 percent of original size 75.85/44.20 [2019-03-28 12:46:03,169 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 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:03,169 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:75 75.85/44.20 [2019-03-28 12:46:03,362 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:46:03,363 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 56 75.85/44.20 [2019-03-28 12:46:03,363 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:03,372 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 52 treesize of output 51 75.85/44.20 [2019-03-28 12:46:03,373 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:03,381 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 75.85/44.20 [2019-03-28 12:46:03,382 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:03,498 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 75.85/44.20 [2019-03-28 12:46:03,499 INFO L497 ElimStorePlain]: treesize reduction 4, result has 97.5 percent of original size 75.85/44.20 [2019-03-28 12:46:03,500 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. 75.85/44.20 [2019-03-28 12:46:03,501 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:169, output treesize:120 75.85/44.20 [2019-03-28 12:46:03,700 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 75.85/44.20 [2019-03-28 12:46:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:04,769 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 75.85/44.20 [2019-03-28 12:46:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:04,780 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 75.85/44.20 [2019-03-28 12:46:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.20 [2019-03-28 12:46:04,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core 75.85/44.20 [2019-03-28 12:46:04,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.85/44.20 [2019-03-28 12:46:04,807 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:46:04,808 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 34 treesize of output 48 75.85/44.20 [2019-03-28 12:46:04,808 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:04,832 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size 75.85/44.20 [2019-03-28 12:46:04,832 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:04,832 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:30 75.85/44.20 [2019-03-28 12:46:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.20 [2019-03-28 12:46:04,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core 75.85/44.20 [2019-03-28 12:46:04,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.85/44.20 [2019-03-28 12:46:04,865 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:46:04,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 48 75.85/44.20 [2019-03-28 12:46:04,866 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:04,888 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size 75.85/44.20 [2019-03-28 12:46:04,888 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:04,889 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:30 75.85/44.20 [2019-03-28 12:46:04,920 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:46:04,920 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 2 case distinctions, treesize of input 53 treesize of output 74 75.85/44.20 [2019-03-28 12:46:04,925 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:05,017 INFO L497 ElimStorePlain]: treesize reduction 29, result has 76.4 percent of original size 75.85/44.20 [2019-03-28 12:46:05,020 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 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:05,020 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:90 75.85/44.20 [2019-03-28 12:46:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.20 [2019-03-28 12:46:05,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core 75.85/44.20 [2019-03-28 12:46:05,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.85/44.20 [2019-03-28 12:46:05,101 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:46:05,102 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 34 treesize of output 48 75.85/44.20 [2019-03-28 12:46:05,102 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:05,125 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size 75.85/44.20 [2019-03-28 12:46:05,125 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:05,126 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:30 75.85/44.20 [2019-03-28 12:46:05,157 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:46:05,157 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 2 case distinctions, treesize of input 53 treesize of output 74 75.85/44.20 [2019-03-28 12:46:05,161 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:05,224 INFO L497 ElimStorePlain]: treesize reduction 18, result has 78.8 percent of original size 75.85/44.20 [2019-03-28 12:46:05,227 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 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:05,228 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:61 75.85/44.20 [2019-03-28 12:46:05,344 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 25 predicates after loop cannibalization 75.85/44.20 [2019-03-28 12:46:05,345 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 25 loop predicates 75.85/44.20 [2019-03-28 12:46:05,345 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 18 states and 51 transitions. cyclomatic complexity: 34 Second operand 8 states. 75.85/44.20 [2019-03-28 12:46:06,175 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 18 states and 51 transitions. cyclomatic complexity: 34. Second operand 8 states. Result 164 states and 207 transitions. Complement of second has 57 states. 75.85/44.20 [2019-03-28 12:46:06,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 5 stem states 6 non-accepting loop states 1 accepting loop states 75.85/44.20 [2019-03-28 12:46:06,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 75.85/44.20 [2019-03-28 12:46:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 118 transitions. 75.85/44.20 [2019-03-28 12:46:06,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 118 transitions. Stem has 4 letters. Loop has 12 letters. 75.85/44.20 [2019-03-28 12:46:06,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.85/44.20 [2019-03-28 12:46:06,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 118 transitions. Stem has 16 letters. Loop has 12 letters. 75.85/44.20 [2019-03-28 12:46:06,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.85/44.20 [2019-03-28 12:46:06,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 118 transitions. Stem has 4 letters. Loop has 24 letters. 75.85/44.20 [2019-03-28 12:46:06,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.85/44.20 [2019-03-28 12:46:06,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 164 states and 207 transitions. 75.85/44.20 [2019-03-28 12:46:06,193 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 48 75.85/44.20 [2019-03-28 12:46:06,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 164 states to 60 states and 91 transitions. 75.85/44.20 [2019-03-28 12:46:06,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 75.85/44.20 [2019-03-28 12:46:06,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 75.85/44.20 [2019-03-28 12:46:06,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 91 transitions. 75.85/44.20 [2019-03-28 12:46:06,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 75.85/44.20 [2019-03-28 12:46:06,195 INFO L706 BuchiCegarLoop]: Abstraction has 60 states and 91 transitions. 75.85/44.20 [2019-03-28 12:46:06,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 91 transitions. 75.85/44.20 [2019-03-28 12:46:06,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 16. 75.85/44.20 [2019-03-28 12:46:06,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 75.85/44.20 [2019-03-28 12:46:06,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 47 transitions. 75.85/44.20 [2019-03-28 12:46:06,197 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 47 transitions. 75.85/44.20 [2019-03-28 12:46:06,197 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 47 transitions. 75.85/44.20 [2019-03-28 12:46:06,197 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 75.85/44.20 [2019-03-28 12:46:06,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 47 transitions. 75.85/44.20 [2019-03-28 12:46:06,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 75.85/44.20 [2019-03-28 12:46:06,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 75.85/44.20 [2019-03-28 12:46:06,198 INFO L119 BuchiIsEmpty]: Starting construction of run 75.85/44.20 [2019-03-28 12:46:06,199 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 75.85/44.20 [2019-03-28 12:46:06,199 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 75.85/44.20 [2019-03-28 12:46:06,199 INFO L794 eck$LassoCheckResult]: Stem: 1757#ULTIMATE.startENTRY [106] 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] 1755#L-1 [165] L-1-->L11: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_#t~malloc3.base_1| 1))) (and (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_main_#t~malloc4.base_1| 1)) (< |v_ULTIMATE.start_main_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc4.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~m~0.base_1 |v_ULTIMATE.start_main_#t~malloc3.base_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~m~0.offset_1 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store (store |v_#length_6| |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_#t~malloc3.base_1| 4) |v_ULTIMATE.start_main_#t~malloc4.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_main_#t~malloc4.base_1|)) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (> |v_ULTIMATE.start_main_#t~malloc3.base_1| 0) (= 0 (select .cse3 |v_ULTIMATE.start_main_#t~malloc3.base_1|)) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_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_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_~m~0.base=v_ULTIMATE.start_main_~m~0.base_1, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_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_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~m~0.offset=v_ULTIMATE.start_main_~m~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_~m~0.base, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~m~0.offset, ULTIMATE.start_main_#t~mem6] 1756#L11 [108] L11-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 1759#L14 [86] L14-->L16-7: Formula: (and (= (select |v_#valid_11| v_ULTIMATE.start_main_~x~0.base_7) 1) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6 (- 1)))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_9| v_ULTIMATE.start_main_~x~0.base_7)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #length=|v_#length_9|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #length=|v_#length_9|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 1752#L16-7 75.85/44.20 [2019-03-28 12:46:06,200 INFO L796 eck$LassoCheckResult]: Loop: 1752#L16-7 [103] L16-7-->L16: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_11| v_ULTIMATE.start_main_~y~0.base_4)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 1750#L16 [181] L16-->L16-1: Formula: (and (< |v_ULTIMATE.start_main_#t~mem6_3| 100) |v_ULTIMATE.start_main_#t~short8_2|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 1747#L16-1 [64] L16-1-->L16-2: Formula: |v_ULTIMATE.start_main_#t~short8_3| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} AuxVars[] AssignedVars[] 1748#L16-2 [89] L16-2-->L16-3: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~z~0.base_4)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_4 4) (select |v_#length_13| v_ULTIMATE.start_main_~z~0.base_4)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~z~0.base_4) v_ULTIMATE.start_main_~z~0.offset_4))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_4, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_4, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_4, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_4, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 1760#L16-3 [187] L16-3-->L16-5: Formula: (and |v_ULTIMATE.start_main_#t~short8_4| (< |v_ULTIMATE.start_main_#t~mem7_3| 100)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_4|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 1758#L16-5 [80] L16-5-->L17: Formula: |v_ULTIMATE.start_main_#t~short8_9| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_9|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short8] 1754#L17 [98] L17-->L17-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~y~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 1749#L17-1 [95] L17-1-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem10_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, #valid=|v_#valid_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 1745#L17-2 [215] L17-2-->L18: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem10_6| |v_ULTIMATE.start_main_#t~mem9_6|))) |v_#memory_int_15|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_27| v_ULTIMATE.start_main_~y~0.base_13)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_13)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_27|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem9, #memory_int] 1746#L18 [74] L18-->L18-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_21| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~z~0.base_7)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6)) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_11|, #length=|v_#length_21|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 1753#L18-1 [71] L18-1-->L18-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_23| v_ULTIMATE.start_main_~x~0.base_13)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10) (= (select |v_#valid_25| v_ULTIMATE.start_main_~x~0.base_13) 1) (= |v_ULTIMATE.start_main_#t~mem12_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_25|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 1751#L18-2 [216] L18-2-->L16-7: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_10 4) (select |v_#length_28| v_ULTIMATE.start_main_~z~0.base_13)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_10) (= (select |v_#valid_42| v_ULTIMATE.start_main_~z~0.base_13) 1) (= |v_#memory_int_17| (store |v_#memory_int_18| v_ULTIMATE.start_main_~z~0.base_13 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~z~0.base_13) v_ULTIMATE.start_main_~z~0.offset_10 (+ (* (- 1) |v_ULTIMATE.start_main_#t~mem12_6|) |v_ULTIMATE.start_main_#t~mem11_6|))))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_13, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_13, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, #memory_int] 1752#L16-7 75.85/44.20 [2019-03-28 12:46:06,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.20 [2019-03-28 12:46:06,200 INFO L82 PathProgramCache]: Analyzing trace with hash 4243366, now seen corresponding path program 1 times 75.85/44.20 [2019-03-28 12:46:06,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.85/44.20 [2019-03-28 12:46:06,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.85/44.20 [2019-03-28 12:46:06,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:06,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:06,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:06,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.20 [2019-03-28 12:46:06,218 INFO L82 PathProgramCache]: Analyzing trace with hash 18652478, now seen corresponding path program 3 times 75.85/44.20 [2019-03-28 12:46:06,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.85/44.20 [2019-03-28 12:46:06,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.85/44.20 [2019-03-28 12:46:06,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:06,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:06,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:06,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.20 [2019-03-28 12:46:06,241 INFO L82 PathProgramCache]: Analyzing trace with hash 497683811, now seen corresponding path program 1 times 75.85/44.20 [2019-03-28 12:46:06,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.85/44.20 [2019-03-28 12:46:06,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.85/44.20 [2019-03-28 12:46:06,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:06,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:06,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:06,789 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 93 75.85/44.20 [2019-03-28 12:46:06,950 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 89 75.85/44.20 [2019-03-28 12:46:06,954 INFO L216 LassoAnalysis]: Preferences: 75.85/44.20 [2019-03-28 12:46:06,954 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 75.85/44.20 [2019-03-28 12:46:06,954 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 75.85/44.20 [2019-03-28 12:46:06,954 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 75.85/44.20 [2019-03-28 12:46:06,955 INFO L127 ssoRankerPreferences]: Use exernal solver: false 75.85/44.20 [2019-03-28 12:46:06,955 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 75.85/44.20 [2019-03-28 12:46:06,955 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 75.85/44.20 [2019-03-28 12:46:06,955 INFO L130 ssoRankerPreferences]: Path of dumped script: 75.85/44.20 [2019-03-28 12:46:06,955 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 75.85/44.20 [2019-03-28 12:46:06,955 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 75.85/44.20 [2019-03-28 12:46:06,955 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 75.85/44.20 [2019-03-28 12:46:06,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:06,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:06,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:06,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:06,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:06,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:06,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:06,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:06,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:06,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:07,325 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 75.85/44.20 [2019-03-28 12:46:07,446 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 75.85/44.20 [2019-03-28 12:46:07,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:07,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:07,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:07,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:07,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:07,857 INFO L300 LassoAnalysis]: Preprocessing complete. 75.85/44.20 [2019-03-28 12:46:07,857 INFO L497 LassoAnalysis]: Using template 'affine'. 75.85/44.20 [2019-03-28 12:46:07,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:07,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:07,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:07,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:07,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:07,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:07,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:07,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:07,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:07,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:07,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.85/44.20 [2019-03-28 12:46:07,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:07,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:07,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:07,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:07,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:07,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:07,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:07,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:07,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.85/44.20 [2019-03-28 12:46:07,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:07,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:07,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:07,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:07,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:07,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:07,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:07,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:07,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:07,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:07,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:07,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:07,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:07,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:07,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:07,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:07,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.85/44.20 [2019-03-28 12:46:07,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:07,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:07,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:07,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:07,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:07,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:07,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:07,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:07,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:07,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:07,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:07,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:07,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:07,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:07,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:07,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:07,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.85/44.20 [2019-03-28 12:46:07,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:07,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:07,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:07,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:07,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:07,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:07,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:07,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:07,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:07,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:07,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:07,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:07,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:07,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:07,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:07,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:07,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 75.85/44.20 [2019-03-28 12:46:07,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:07,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:07,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:07,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:07,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:07,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:07,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:07,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:07,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:07,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:07,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:07,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:07,884 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:07,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:07,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:07,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:07,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:07,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:07,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:07,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:07,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:07,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:07,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:07,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:07,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:07,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:07,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:07,894 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:07,894 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:07,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:07,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:07,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:07,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:07,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:07,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:07,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:07,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:07,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:07,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:07,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:07,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:07,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:07,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:07,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:07,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:07,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:07,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:07,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:07,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:07,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:07,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:07,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:07,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:07,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:07,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:07,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:07,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:07,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:07,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:07,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:07,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:07,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:07,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:07,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:07,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:07,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:07,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:07,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:07,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:07,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:07,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:07,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:07,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:07,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:07,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:07,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:07,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:07,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:07,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:07,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:07,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:07,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:07,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:07,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:07,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:07,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:07,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:07,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:07,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:07,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:07,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:07,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:07,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:07,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:07,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:07,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:07,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:07,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:07,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:07,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:07,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:07,944 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 75.85/44.20 [2019-03-28 12:46:07,948 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 75.85/44.20 [2019-03-28 12:46:07,948 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. 75.85/44.20 [2019-03-28 12:46:07,948 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 75.85/44.20 [2019-03-28 12:46:07,949 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 75.85/44.20 [2019-03-28 12:46:07,949 INFO L518 LassoAnalysis]: Proved termination. 75.85/44.20 [2019-03-28 12:46:07,950 INFO L520 LassoAnalysis]: Termination argument consisting of: 75.85/44.20 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3 + 199 75.85/44.20 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 - 1 >= 0] 75.85/44.20 [2019-03-28 12:46:08,100 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed 75.85/44.20 [2019-03-28 12:46:08,107 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 75.85/44.20 [2019-03-28 12:46:08,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.20 [2019-03-28 12:46:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.20 [2019-03-28 12:46:08,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core 75.85/44.20 [2019-03-28 12:46:08,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.85/44.20 [2019-03-28 12:46:08,151 INFO L189 IndexEqualityManager]: detected not equals via solver 75.85/44.20 [2019-03-28 12:46:08,153 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 75.85/44.20 [2019-03-28 12:46:08,153 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:08,160 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:46:08,160 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:08,160 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 75.85/44.20 [2019-03-28 12:46:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.20 [2019-03-28 12:46:08,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 15 conjunts are in the unsatisfiable core 75.85/44.20 [2019-03-28 12:46:08,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.85/44.20 [2019-03-28 12:46:08,315 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:46:08,315 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 55 treesize of output 83 75.85/44.20 [2019-03-28 12:46:08,319 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:08,404 INFO L497 ElimStorePlain]: treesize reduction 55, result has 60.1 percent of original size 75.85/44.20 [2019-03-28 12:46:08,405 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:08,406 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:66, output treesize:62 75.85/44.20 [2019-03-28 12:46:13,026 WARN L188 SmtUtils]: Spent 3.66 s on a formula simplification that was a NOOP. DAG size: 42 75.85/44.20 [2019-03-28 12:46:14,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.85/44.20 [2019-03-28 12:46:16,052 WARN L860 $PredicateComparison]: unable to prove that (or (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_main_~y~0.base) c_ULTIMATE.start_main_~x~0.offset) 2) 0) (exists ((ULTIMATE.start_main_~y~0.offset Int)) (not (and (= c_ULTIMATE.start_main_~x~0.base c_ULTIMATE.start_main_~y~0.base) (= ULTIMATE.start_main_~y~0.offset c_ULTIMATE.start_main_~x~0.offset))))) is different from true 75.85/44.20 [2019-03-28 12:46:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:16,149 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 75.85/44.20 [2019-03-28 12:46:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:16,160 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 75.85/44.20 [2019-03-28 12:46:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:16,171 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 75.85/44.20 [2019-03-28 12:46:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.20 [2019-03-28 12:46:16,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 15 conjunts are in the unsatisfiable core 75.85/44.20 [2019-03-28 12:46:16,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.85/44.20 [2019-03-28 12:46:16,259 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 50 treesize of output 37 75.85/44.20 [2019-03-28 12:46:16,260 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:16,274 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:46:16,275 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:16,275 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:41 75.85/44.20 [2019-03-28 12:46:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:17,525 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 75.85/44.20 [2019-03-28 12:46:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:17,537 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 75.85/44.20 [2019-03-28 12:46:17,537 INFO L98 LoopCannibalizer]: 15 predicates before loop cannibalization 16 predicates after loop cannibalization 75.85/44.20 [2019-03-28 12:46:17,537 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 16 loop predicates 75.85/44.20 [2019-03-28 12:46:17,538 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 47 transitions. cyclomatic complexity: 32 Second operand 11 states. 75.85/44.20 [2019-03-28 12:46:22,690 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 47 transitions. cyclomatic complexity: 32. Second operand 11 states. Result 244 states and 279 transitions. Complement of second has 172 states. 75.85/44.20 [2019-03-28 12:46:22,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 40 states 5 stem states 32 non-accepting loop states 3 accepting loop states 75.85/44.20 [2019-03-28 12:46:22,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 75.85/44.20 [2019-03-28 12:46:22,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 141 transitions. 75.85/44.20 [2019-03-28 12:46:22,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 141 transitions. Stem has 4 letters. Loop has 12 letters. 75.85/44.20 [2019-03-28 12:46:22,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.85/44.20 [2019-03-28 12:46:22,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 141 transitions. Stem has 16 letters. Loop has 12 letters. 75.85/44.20 [2019-03-28 12:46:22,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.85/44.20 [2019-03-28 12:46:22,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 141 transitions. Stem has 4 letters. Loop has 24 letters. 75.85/44.20 [2019-03-28 12:46:22,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.85/44.20 [2019-03-28 12:46:22,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 244 states and 279 transitions. 75.85/44.20 [2019-03-28 12:46:22,707 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 75.85/44.20 [2019-03-28 12:46:22,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 244 states to 116 states and 139 transitions. 75.85/44.20 [2019-03-28 12:46:22,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 75.85/44.20 [2019-03-28 12:46:22,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 75.85/44.20 [2019-03-28 12:46:22,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 139 transitions. 75.85/44.20 [2019-03-28 12:46:22,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 75.85/44.20 [2019-03-28 12:46:22,710 INFO L706 BuchiCegarLoop]: Abstraction has 116 states and 139 transitions. 75.85/44.20 [2019-03-28 12:46:22,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 139 transitions. 75.85/44.20 [2019-03-28 12:46:22,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 16. 75.85/44.20 [2019-03-28 12:46:22,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 75.85/44.20 [2019-03-28 12:46:22,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 39 transitions. 75.85/44.20 [2019-03-28 12:46:22,712 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 39 transitions. 75.85/44.20 [2019-03-28 12:46:22,712 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 39 transitions. 75.85/44.20 [2019-03-28 12:46:22,712 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 75.85/44.20 [2019-03-28 12:46:22,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 39 transitions. 75.85/44.20 [2019-03-28 12:46:22,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 75.85/44.20 [2019-03-28 12:46:22,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 75.85/44.20 [2019-03-28 12:46:22,713 INFO L119 BuchiIsEmpty]: Starting construction of run 75.85/44.20 [2019-03-28 12:46:22,714 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 75.85/44.20 [2019-03-28 12:46:22,714 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 75.85/44.20 [2019-03-28 12:46:22,714 INFO L794 eck$LassoCheckResult]: Stem: 2554#ULTIMATE.startENTRY [106] 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] 2552#L-1 [158] L-1-->L11: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_#t~malloc3.base_1| 1))) (and (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc3.base_1| 0) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_main_#t~malloc4.base_1| 1)) (< |v_ULTIMATE.start_main_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc4.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~m~0.base_1 |v_ULTIMATE.start_main_#t~malloc3.base_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~m~0.offset_1 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store (store |v_#length_6| |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_#t~malloc3.base_1| 4) |v_ULTIMATE.start_main_#t~malloc4.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_main_#t~malloc4.base_1|)) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= 0 (select .cse3 |v_ULTIMATE.start_main_#t~malloc3.base_1|)) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_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_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_~m~0.base=v_ULTIMATE.start_main_~m~0.base_1, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_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_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~m~0.offset=v_ULTIMATE.start_main_~m~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_~m~0.base, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~m~0.offset, ULTIMATE.start_main_#t~mem6] 2553#L11 [108] L11-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 2555#L14 [86] L14-->L16-7: Formula: (and (= (select |v_#valid_11| v_ULTIMATE.start_main_~x~0.base_7) 1) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6 (- 1)))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_9| v_ULTIMATE.start_main_~x~0.base_7)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #length=|v_#length_9|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #length=|v_#length_9|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 2549#L16-7 75.85/44.20 [2019-03-28 12:46:22,715 INFO L796 eck$LassoCheckResult]: Loop: 2549#L16-7 [103] L16-7-->L16: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_11| v_ULTIMATE.start_main_~y~0.base_4)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 2546#L16 [181] L16-->L16-1: Formula: (and (< |v_ULTIMATE.start_main_#t~mem6_3| 100) |v_ULTIMATE.start_main_#t~short8_2|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 2542#L16-1 [64] L16-1-->L16-2: Formula: |v_ULTIMATE.start_main_#t~short8_3| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} AuxVars[] AssignedVars[] 2543#L16-2 [89] L16-2-->L16-3: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~z~0.base_4)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_4 4) (select |v_#length_13| v_ULTIMATE.start_main_~z~0.base_4)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~z~0.base_4) v_ULTIMATE.start_main_~z~0.offset_4))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_4, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_4, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_4, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_4, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 2557#L16-3 [187] L16-3-->L16-5: Formula: (and |v_ULTIMATE.start_main_#t~short8_4| (< |v_ULTIMATE.start_main_#t~mem7_3| 100)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_4|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 2556#L16-5 [80] L16-5-->L17: Formula: |v_ULTIMATE.start_main_#t~short8_9| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_9|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short8] 2550#L17 [98] L17-->L17-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~y~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 2547#L17-1 [95] L17-1-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem10_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, #valid=|v_#valid_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 2544#L17-2 [215] L17-2-->L18: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem10_6| |v_ULTIMATE.start_main_#t~mem9_6|))) |v_#memory_int_15|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_27| v_ULTIMATE.start_main_~y~0.base_13)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_13)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_27|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem9, #memory_int] 2545#L18 [74] L18-->L18-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_21| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~z~0.base_7)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6)) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_11|, #length=|v_#length_21|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 2551#L18-1 [71] L18-1-->L18-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_23| v_ULTIMATE.start_main_~x~0.base_13)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10) (= (select |v_#valid_25| v_ULTIMATE.start_main_~x~0.base_13) 1) (= |v_ULTIMATE.start_main_#t~mem12_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_25|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 2548#L18-2 [216] L18-2-->L16-7: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_10 4) (select |v_#length_28| v_ULTIMATE.start_main_~z~0.base_13)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_10) (= (select |v_#valid_42| v_ULTIMATE.start_main_~z~0.base_13) 1) (= |v_#memory_int_17| (store |v_#memory_int_18| v_ULTIMATE.start_main_~z~0.base_13 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~z~0.base_13) v_ULTIMATE.start_main_~z~0.offset_10 (+ (* (- 1) |v_ULTIMATE.start_main_#t~mem12_6|) |v_ULTIMATE.start_main_#t~mem11_6|))))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_13, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_13, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, #memory_int] 2549#L16-7 75.85/44.20 [2019-03-28 12:46:22,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.20 [2019-03-28 12:46:22,715 INFO L82 PathProgramCache]: Analyzing trace with hash 4236639, now seen corresponding path program 1 times 75.85/44.20 [2019-03-28 12:46:22,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.85/44.20 [2019-03-28 12:46:22,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.85/44.20 [2019-03-28 12:46:22,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:22,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:22,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:22,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.20 [2019-03-28 12:46:22,732 INFO L82 PathProgramCache]: Analyzing trace with hash 18652478, now seen corresponding path program 4 times 75.85/44.20 [2019-03-28 12:46:22,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.85/44.20 [2019-03-28 12:46:22,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.85/44.20 [2019-03-28 12:46:22,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:22,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:22,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:22,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.20 [2019-03-28 12:46:22,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1465244260, now seen corresponding path program 1 times 75.85/44.20 [2019-03-28 12:46:22,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 75.85/44.20 [2019-03-28 12:46:22,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 75.85/44.20 [2019-03-28 12:46:22,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:22,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:22,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 75.85/44.20 [2019-03-28 12:46:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:23,292 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 93 75.85/44.20 [2019-03-28 12:46:23,466 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 89 75.85/44.20 [2019-03-28 12:46:23,470 INFO L216 LassoAnalysis]: Preferences: 75.85/44.20 [2019-03-28 12:46:23,470 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 75.85/44.20 [2019-03-28 12:46:23,470 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 75.85/44.20 [2019-03-28 12:46:23,471 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 75.85/44.20 [2019-03-28 12:46:23,471 INFO L127 ssoRankerPreferences]: Use exernal solver: false 75.85/44.20 [2019-03-28 12:46:23,471 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 75.85/44.20 [2019-03-28 12:46:23,471 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 75.85/44.20 [2019-03-28 12:46:23,471 INFO L130 ssoRankerPreferences]: Path of dumped script: 75.85/44.20 [2019-03-28 12:46:23,471 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 75.85/44.20 [2019-03-28 12:46:23,471 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 75.85/44.20 [2019-03-28 12:46:23,471 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 75.85/44.20 [2019-03-28 12:46:23,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:23,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:23,890 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 75.85/44.20 [2019-03-28 12:46:23,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:23,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:23,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:24,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:24,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:24,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:24,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:24,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:24,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:24,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:24,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:24,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 75.85/44.20 [2019-03-28 12:46:24,452 INFO L300 LassoAnalysis]: Preprocessing complete. 75.85/44.20 [2019-03-28 12:46:24,452 INFO L497 LassoAnalysis]: Using template 'affine'. 75.85/44.20 [2019-03-28 12:46:24,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:24,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:24,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:24,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:24,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:24,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:24,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:24,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:24,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:24,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:24,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:24,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:24,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:24,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:24,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:24,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:24,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:24,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:24,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:24,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:24,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:24,462 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:24,462 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:24,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:24,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:24,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:24,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:24,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:24,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:24,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:24,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:24,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:24,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:24,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:24,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:24,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:24,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:24,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:24,470 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:24,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:24,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:24,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:24,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:24,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:24,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:24,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:24,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:24,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:24,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:24,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:24,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:24,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:24,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:24,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:24,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:24,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:24,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:24,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:24,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:24,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:24,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:24,483 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:24,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:24,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:24,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:24,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:24,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:24,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:24,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:24,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:24,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:24,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:24,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:24,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:24,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:24,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:24,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:24,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:24,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:24,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:24,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:24,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:24,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:24,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:24,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:24,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:24,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:24,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:24,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:24,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:24,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:24,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:24,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:24,500 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:24,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:24,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:24,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:24,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:24,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:24,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:24,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:24,515 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:24,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:24,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 75.85/44.20 [2019-03-28 12:46:24,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 75.85/44.20 Termination analysis: LINEAR_WITH_GUESSES 75.85/44.20 Number of strict supporting invariants: 0 75.85/44.20 Number of non-strict supporting invariants: 1 75.85/44.20 Consider only non-deceasing supporting invariants: true 75.85/44.20 Simplify termination arguments: true 75.85/44.20 Simplify supporting invariants: trueOverapproximate stem: false 75.85/44.20 [2019-03-28 12:46:24,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. 75.85/44.20 [2019-03-28 12:46:24,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 75.85/44.20 [2019-03-28 12:46:24,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 75.85/44.20 [2019-03-28 12:46:24,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 75.85/44.20 [2019-03-28 12:46:24,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 75.85/44.20 [2019-03-28 12:46:24,524 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 75.85/44.20 [2019-03-28 12:46:24,531 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 75.85/44.20 [2019-03-28 12:46:24,538 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 75.85/44.20 [2019-03-28 12:46:24,538 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. 75.85/44.20 [2019-03-28 12:46:24,538 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 75.85/44.20 [2019-03-28 12:46:24,539 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 75.85/44.20 [2019-03-28 12:46:24,539 INFO L518 LassoAnalysis]: Proved termination. 75.85/44.20 [2019-03-28 12:46:24,540 INFO L520 LassoAnalysis]: Termination argument consisting of: 75.85/44.20 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_4, v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_4 - 199*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4 75.85/44.20 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4 - 1 >= 0] 75.85/44.20 [2019-03-28 12:46:24,756 INFO L297 tatePredicateManager]: 35 out of 40 supporting invariants were superfluous and have been removed 75.85/44.20 [2019-03-28 12:46:24,767 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 75.85/44.20 [2019-03-28 12:46:24,768 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 75.85/44.20 [2019-03-28 12:46:24,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 75.85/44.20 [2019-03-28 12:46:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.20 [2019-03-28 12:46:24,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 18 conjunts are in the unsatisfiable core 75.85/44.20 [2019-03-28 12:46:24,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.85/44.20 [2019-03-28 12:46:24,828 INFO L189 IndexEqualityManager]: detected not equals via solver 75.85/44.20 [2019-03-28 12:46:24,829 INFO L189 IndexEqualityManager]: detected not equals via solver 75.85/44.20 [2019-03-28 12:46:24,832 INFO L189 IndexEqualityManager]: detected not equals via solver 75.85/44.20 [2019-03-28 12:46:24,834 INFO L189 IndexEqualityManager]: detected not equals via solver 75.85/44.20 [2019-03-28 12:46:24,838 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:46:24,839 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 32 treesize of output 34 75.85/44.20 [2019-03-28 12:46:24,839 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:24,855 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:46:24,856 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:24,856 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:23 75.85/44.20 [2019-03-28 12:46:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.20 [2019-03-28 12:46:24,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core 75.85/44.20 [2019-03-28 12:46:24,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.85/44.20 [2019-03-28 12:46:24,942 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 75.85/44.20 [2019-03-28 12:46:24,943 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:24,962 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:46:24,962 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:24,963 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:63, output treesize:50 75.85/44.20 [2019-03-28 12:46:25,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 75.85/44.20 [2019-03-28 12:46:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:25,206 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 75.85/44.20 [2019-03-28 12:46:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.20 [2019-03-28 12:46:25,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core 75.85/44.20 [2019-03-28 12:46:25,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.85/44.20 [2019-03-28 12:46:25,223 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 75.85/44.20 [2019-03-28 12:46:25,223 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:25,236 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:46:25,237 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:25,237 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:43 75.85/44.20 [2019-03-28 12:46:25,322 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 40 75.85/44.20 [2019-03-28 12:46:25,323 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:25,339 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:46:25,340 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:25,340 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:52 75.85/44.20 [2019-03-28 12:46:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.20 [2019-03-28 12:46:25,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core 75.85/44.20 [2019-03-28 12:46:25,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.85/44.20 [2019-03-28 12:46:25,535 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 75.85/44.20 [2019-03-28 12:46:25,536 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:25,553 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:46:25,554 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:25,554 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:43 75.85/44.20 [2019-03-28 12:46:25,570 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 40 75.85/44.20 [2019-03-28 12:46:25,571 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:25,593 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:46:25,594 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:25,595 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:52 75.85/44.20 [2019-03-28 12:46:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 75.85/44.20 [2019-03-28 12:46:25,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core 75.85/44.20 [2019-03-28 12:46:25,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... 75.85/44.20 [2019-03-28 12:46:25,660 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 40 75.85/44.20 [2019-03-28 12:46:25,661 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:25,683 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 75.85/44.20 [2019-03-28 12:46:25,684 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 75.85/44.20 [2019-03-28 12:46:25,684 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:52 75.85/44.20 [2019-03-28 12:46:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:25,739 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 75.85/44.20 [2019-03-28 12:46:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 75.85/44.20 [2019-03-28 12:46:25,750 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 75.85/44.20 [2019-03-28 12:46:25,750 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 11 predicates after loop cannibalization 75.85/44.20 [2019-03-28 12:46:25,751 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 11 loop predicates 75.85/44.20 [2019-03-28 12:46:25,751 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 39 transitions. cyclomatic complexity: 24 Second operand 8 states. 75.85/44.20 [2019-03-28 12:46:26,238 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 39 transitions. cyclomatic complexity: 24. Second operand 8 states. Result 106 states and 133 transitions. Complement of second has 57 states. 75.85/44.20 [2019-03-28 12:46:26,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 5 stem states 6 non-accepting loop states 1 accepting loop states 75.85/44.20 [2019-03-28 12:46:26,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 75.85/44.20 [2019-03-28 12:46:26,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 97 transitions. 75.85/44.20 [2019-03-28 12:46:26,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 97 transitions. Stem has 4 letters. Loop has 12 letters. 75.85/44.20 [2019-03-28 12:46:26,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.85/44.20 [2019-03-28 12:46:26,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 97 transitions. Stem has 16 letters. Loop has 12 letters. 75.85/44.20 [2019-03-28 12:46:26,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.85/44.20 [2019-03-28 12:46:26,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 97 transitions. Stem has 4 letters. Loop has 24 letters. 75.85/44.20 [2019-03-28 12:46:26,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. 75.85/44.20 [2019-03-28 12:46:26,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 133 transitions. 75.85/44.20 [2019-03-28 12:46:26,252 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 75.85/44.20 [2019-03-28 12:46:26,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 0 states and 0 transitions. 75.85/44.20 [2019-03-28 12:46:26,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 75.85/44.20 [2019-03-28 12:46:26,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 75.85/44.20 [2019-03-28 12:46:26,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 75.85/44.20 [2019-03-28 12:46:26,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 75.85/44.20 [2019-03-28 12:46:26,253 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 75.85/44.20 [2019-03-28 12:46:26,253 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 75.85/44.20 [2019-03-28 12:46:26,253 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 75.85/44.20 [2019-03-28 12:46:26,253 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 75.85/44.20 [2019-03-28 12:46:26,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 75.85/44.20 [2019-03-28 12:46:26,253 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 75.85/44.20 [2019-03-28 12:46:26,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 75.85/44.20 [2019-03-28 12:46:26,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:26 BasicIcfg 75.85/44.20 [2019-03-28 12:46:26,260 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 75.85/44.20 [2019-03-28 12:46:26,261 INFO L168 Benchmark]: Toolchain (without parser) took 39966.49 ms. Allocated memory was 649.6 MB in the beginning and 1.1 GB in the end (delta: 406.3 MB). Free memory was 563.9 MB in the beginning and 666.9 MB in the end (delta: -103.0 MB). Peak memory consumption was 303.3 MB. Max. memory is 50.3 GB. 75.85/44.20 [2019-03-28 12:46:26,262 INFO L168 Benchmark]: CDTParser took 0.17 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. 75.85/44.20 [2019-03-28 12:46:26,262 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.26 ms. Allocated memory was 649.6 MB in the beginning and 674.8 MB in the end (delta: 25.2 MB). Free memory was 563.9 MB in the beginning and 639.9 MB in the end (delta: -76.0 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 75.85/44.20 [2019-03-28 12:46:26,262 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.42 ms. Allocated memory is still 674.8 MB. Free memory was 639.9 MB in the beginning and 636.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 75.85/44.20 [2019-03-28 12:46:26,263 INFO L168 Benchmark]: Boogie Preprocessor took 24.63 ms. Allocated memory is still 674.8 MB. Free memory was 636.8 MB in the beginning and 635.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 75.85/44.20 [2019-03-28 12:46:26,263 INFO L168 Benchmark]: RCFGBuilder took 346.83 ms. Allocated memory is still 674.8 MB. Free memory was 635.4 MB in the beginning and 610.6 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 50.3 GB. 75.85/44.20 [2019-03-28 12:46:26,264 INFO L168 Benchmark]: BlockEncodingV2 took 157.92 ms. Allocated memory is still 674.8 MB. Free memory was 610.6 MB in the beginning and 591.8 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 50.3 GB. 75.85/44.20 [2019-03-28 12:46:26,265 INFO L168 Benchmark]: TraceAbstraction took 2763.13 ms. Allocated memory was 674.8 MB in the beginning and 743.4 MB in the end (delta: 68.7 MB). Free memory was 590.4 MB in the beginning and 597.6 MB in the end (delta: -7.2 MB). Peak memory consumption was 61.5 MB. Max. memory is 50.3 GB. 75.85/44.20 [2019-03-28 12:46:26,265 INFO L168 Benchmark]: BuchiAutomizer took 36319.98 ms. Allocated memory was 743.4 MB in the beginning and 1.1 GB in the end (delta: 312.5 MB). Free memory was 597.6 MB in the beginning and 666.9 MB in the end (delta: -69.3 MB). Peak memory consumption was 243.1 MB. Max. memory is 50.3 GB. 75.85/44.20 [2019-03-28 12:46:26,268 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 75.85/44.20 --- Results --- 75.85/44.20 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 75.85/44.20 - StatisticsResult: Initial Icfg 75.85/44.20 43 locations, 46 edges 75.85/44.20 - StatisticsResult: Encoded RCFG 75.85/44.20 37 locations, 93 edges 75.85/44.20 * Results from de.uni_freiburg.informatik.ultimate.core: 75.85/44.20 - StatisticsResult: Toolchain Benchmarks 75.85/44.20 Benchmark results are: 75.85/44.20 * CDTParser took 0.17 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. 75.85/44.20 * CACSL2BoogieTranslator took 307.26 ms. Allocated memory was 649.6 MB in the beginning and 674.8 MB in the end (delta: 25.2 MB). Free memory was 563.9 MB in the beginning and 639.9 MB in the end (delta: -76.0 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 75.85/44.20 * Boogie Procedure Inliner took 40.42 ms. Allocated memory is still 674.8 MB. Free memory was 639.9 MB in the beginning and 636.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 75.85/44.20 * Boogie Preprocessor took 24.63 ms. Allocated memory is still 674.8 MB. Free memory was 636.8 MB in the beginning and 635.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 75.85/44.20 * RCFGBuilder took 346.83 ms. Allocated memory is still 674.8 MB. Free memory was 635.4 MB in the beginning and 610.6 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 50.3 GB. 75.85/44.20 * BlockEncodingV2 took 157.92 ms. Allocated memory is still 674.8 MB. Free memory was 610.6 MB in the beginning and 591.8 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 50.3 GB. 75.85/44.20 * TraceAbstraction took 2763.13 ms. Allocated memory was 674.8 MB in the beginning and 743.4 MB in the end (delta: 68.7 MB). Free memory was 590.4 MB in the beginning and 597.6 MB in the end (delta: -7.2 MB). Peak memory consumption was 61.5 MB. Max. memory is 50.3 GB. 75.85/44.20 * BuchiAutomizer took 36319.98 ms. Allocated memory was 743.4 MB in the beginning and 1.1 GB in the end (delta: 312.5 MB). Free memory was 597.6 MB in the beginning and 666.9 MB in the end (delta: -69.3 MB). Peak memory consumption was 243.1 MB. Max. memory is 50.3 GB. 75.85/44.20 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 75.85/44.20 - GenericResult: Unfinished Backtranslation 75.85/44.20 unknown boogie variable #memory_int 75.85/44.20 - GenericResult: Unfinished Backtranslation 75.85/44.20 unknown boogie variable #memory_int 75.85/44.20 - GenericResult: Unfinished Backtranslation 75.85/44.20 unknown boogie variable #memory_int 75.85/44.20 - GenericResult: Unfinished Backtranslation 75.85/44.20 unknown boogie variable #memory_int 75.85/44.20 - GenericResult: Unfinished Backtranslation 75.85/44.20 unknown boogie variable #memory_int 75.85/44.20 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 75.85/44.20 - PositiveResult [Line: 14]: pointer dereference always succeeds 75.85/44.20 For all program executions holds that pointer dereference always succeeds at this location 75.85/44.20 - PositiveResult [Line: 16]: pointer dereference always succeeds 75.85/44.20 For all program executions holds that pointer dereference always succeeds at this location 75.85/44.20 - PositiveResult [Line: 18]: pointer dereference always succeeds 75.85/44.20 For all program executions holds that pointer dereference always succeeds at this location 75.85/44.20 - PositiveResult [Line: 14]: pointer dereference always succeeds 75.85/44.20 For all program executions holds that pointer dereference always succeeds at this location 75.85/44.20 - PositiveResult [Line: 17]: pointer dereference always succeeds 75.85/44.20 For all program executions holds that pointer dereference always succeeds at this location 75.85/44.20 - PositiveResult [Line: 17]: pointer dereference always succeeds 75.85/44.20 For all program executions holds that pointer dereference always succeeds at this location 75.85/44.20 - PositiveResult [Line: 17]: pointer dereference always succeeds 75.85/44.20 For all program executions holds that pointer dereference always succeeds at this location 75.85/44.20 - PositiveResult [Line: 12]: pointer dereference always succeeds 75.85/44.20 For all program executions holds that pointer dereference always succeeds at this location 75.85/44.20 - PositiveResult [Line: 12]: pointer dereference always succeeds 75.85/44.20 For all program executions holds that pointer dereference always succeeds at this location 75.85/44.20 - PositiveResult [Line: 17]: pointer dereference always succeeds 75.85/44.20 For all program executions holds that pointer dereference always succeeds at this location 75.85/44.20 - PositiveResult [Line: 17]: pointer dereference always succeeds 75.85/44.20 For all program executions holds that pointer dereference always succeeds at this location 75.85/44.20 - PositiveResult [Line: 18]: pointer dereference always succeeds 75.85/44.20 For all program executions holds that pointer dereference always succeeds at this location 75.85/44.20 - PositiveResult [Line: 17]: pointer dereference always succeeds 75.85/44.20 For all program executions holds that pointer dereference always succeeds at this location 75.85/44.20 - PositiveResult [Line: 16]: pointer dereference always succeeds 75.85/44.20 For all program executions holds that pointer dereference always succeeds at this location 75.85/44.20 - PositiveResult [Line: 18]: pointer dereference always succeeds 75.85/44.20 For all program executions holds that pointer dereference always succeeds at this location 75.85/44.20 - PositiveResult [Line: 18]: pointer dereference always succeeds 75.85/44.20 For all program executions holds that pointer dereference always succeeds at this location 75.85/44.20 - PositiveResult [Line: 16]: pointer dereference always succeeds 75.85/44.20 For all program executions holds that pointer dereference always succeeds at this location 75.85/44.20 - PositiveResult [Line: 18]: pointer dereference always succeeds 75.85/44.20 For all program executions holds that pointer dereference always succeeds at this location 75.85/44.20 - PositiveResult [Line: 18]: pointer dereference always succeeds 75.85/44.20 For all program executions holds that pointer dereference always succeeds at this location 75.85/44.20 - PositiveResult [Line: 16]: pointer dereference always succeeds 75.85/44.20 For all program executions holds that pointer dereference always succeeds at this location 75.85/44.20 - AllSpecificationsHoldResult: All specifications hold 75.85/44.20 20 specifications checked. All of them hold 75.85/44.20 - StatisticsResult: Ultimate Automizer benchmark data 75.85/44.20 CFG has 1 procedures, 37 locations, 20 error locations. SAFE Result, 2.6s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 76 SDtfs, 303 SDslu, 33 SDs, 0 SdLazy, 648 SolverSat, 345 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred 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, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 0 LocationsWithAnnotation, 0 PreInvPairs, 0 NumberOfFragments, 0 HoareAnnotationTreeSize, 0 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 0 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 59 NumberOfCodeBlocks, 59 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 1188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 75.85/44.20 - StatisticsResult: Constructed decomposition of program 75.85/44.20 Your program was decomposed into 5 terminating modules (1 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y][y] + 199 and consists of 38 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y][y] + 199 and consists of 12 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z][z] + 199 and consists of 40 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z][z] + -199 * unknown-#memory_int-unknown[x][x] and consists of 12 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. 75.85/44.20 - StatisticsResult: Timing statistics 75.85/44.20 BüchiAutomizer plugin needed 36.2s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 8.2s. Construction of modules took 1.8s. Büchi inclusion checks took 26.1s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 322 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 2. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 69 SDtfs, 1441 SDslu, 380 SDs, 0 SdLazy, 1548 SolverSat, 623 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital356 mio100 ax100 hnf100 lsp94 ukn57 mio100 lsp37 div100 bol100 ite100 ukn100 eq189 hnf88 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 75.85/44.20 - TerminationAnalysisResult: Termination proven 75.85/44.20 Buchi Automizer proved that your program is terminating 75.85/44.20 RESULT: Ultimate proved your program to be correct! 75.85/44.20 !SESSION 2019-03-28 12:45:42.993 ----------------------------------------------- 75.85/44.20 eclipse.buildId=unknown 75.85/44.20 java.version=1.8.0_181 75.85/44.20 java.vendor=Oracle Corporation 75.85/44.20 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 75.85/44.20 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 75.85/44.20 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 75.85/44.20 75.85/44.20 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:46:26.500 75.85/44.20 !MESSAGE The workspace will exit with unsaved changes in this session. 75.85/44.20 Received shutdown request... 75.85/44.20 Ultimate: 75.85/44.20 GTK+ Version Check 75.85/44.20 EOF