200.13/159.36 YES 200.13/159.36 200.13/159.36 Ultimate: Cannot open display: 200.13/159.36 This is Ultimate 0.1.24-8dc7c08-m 200.13/159.36 [2019-03-28 12:45:45,029 INFO L170 SettingsManager]: Resetting all preferences to default values... 200.13/159.36 [2019-03-28 12:45:45,031 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 200.13/159.36 [2019-03-28 12:45:45,042 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 200.13/159.36 [2019-03-28 12:45:45,043 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 200.13/159.36 [2019-03-28 12:45:45,044 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 200.13/159.36 [2019-03-28 12:45:45,045 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 200.13/159.36 [2019-03-28 12:45:45,046 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 200.13/159.36 [2019-03-28 12:45:45,048 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 200.13/159.36 [2019-03-28 12:45:45,049 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 200.13/159.36 [2019-03-28 12:45:45,049 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 200.13/159.36 [2019-03-28 12:45:45,050 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 200.13/159.36 [2019-03-28 12:45:45,051 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 200.13/159.36 [2019-03-28 12:45:45,051 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 200.13/159.36 [2019-03-28 12:45:45,052 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 200.13/159.36 [2019-03-28 12:45:45,053 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 200.13/159.36 [2019-03-28 12:45:45,054 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 200.13/159.36 [2019-03-28 12:45:45,056 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 200.13/159.36 [2019-03-28 12:45:45,058 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 200.13/159.36 [2019-03-28 12:45:45,059 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 200.13/159.36 [2019-03-28 12:45:45,060 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 200.13/159.36 [2019-03-28 12:45:45,061 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 200.13/159.36 [2019-03-28 12:45:45,063 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 200.13/159.36 [2019-03-28 12:45:45,063 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 200.13/159.36 [2019-03-28 12:45:45,064 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 200.13/159.36 [2019-03-28 12:45:45,064 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 200.13/159.36 [2019-03-28 12:45:45,065 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 200.13/159.36 [2019-03-28 12:45:45,066 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 200.13/159.36 [2019-03-28 12:45:45,066 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 200.13/159.36 [2019-03-28 12:45:45,066 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 200.13/159.36 [2019-03-28 12:45:45,067 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 200.13/159.36 [2019-03-28 12:45:45,068 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 200.13/159.36 [2019-03-28 12:45:45,069 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 200.13/159.36 [2019-03-28 12:45:45,069 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 200.13/159.36 [2019-03-28 12:45:45,070 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 200.13/159.36 [2019-03-28 12:45:45,070 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 200.13/159.36 [2019-03-28 12:45:45,070 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 200.13/159.36 [2019-03-28 12:45:45,071 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 200.13/159.36 [2019-03-28 12:45:45,072 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 200.13/159.36 [2019-03-28 12:45:45,072 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 200.13/159.36 [2019-03-28 12:45:45,086 INFO L110 SettingsManager]: Loading preferences was successful 200.13/159.36 [2019-03-28 12:45:45,086 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 200.13/159.36 [2019-03-28 12:45:45,087 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 200.13/159.36 [2019-03-28 12:45:45,088 INFO L133 SettingsManager]: * Rewrite not-equals=true 200.13/159.36 [2019-03-28 12:45:45,088 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 200.13/159.36 [2019-03-28 12:45:45,088 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 200.13/159.36 [2019-03-28 12:45:45,088 INFO L133 SettingsManager]: * Use SBE=true 200.13/159.36 [2019-03-28 12:45:45,088 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 200.13/159.36 [2019-03-28 12:45:45,089 INFO L133 SettingsManager]: * Use old map elimination=false 200.13/159.36 [2019-03-28 12:45:45,089 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 200.13/159.36 [2019-03-28 12:45:45,089 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 200.13/159.36 [2019-03-28 12:45:45,089 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 200.13/159.36 [2019-03-28 12:45:45,089 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 200.13/159.36 [2019-03-28 12:45:45,089 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 200.13/159.36 [2019-03-28 12:45:45,090 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 200.13/159.36 [2019-03-28 12:45:45,090 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 200.13/159.36 [2019-03-28 12:45:45,090 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 200.13/159.36 [2019-03-28 12:45:45,090 INFO L133 SettingsManager]: * Check division by zero=IGNORE 200.13/159.36 [2019-03-28 12:45:45,090 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 200.13/159.36 [2019-03-28 12:45:45,090 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 200.13/159.36 [2019-03-28 12:45:45,091 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 200.13/159.36 [2019-03-28 12:45:45,091 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 200.13/159.36 [2019-03-28 12:45:45,091 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 200.13/159.36 [2019-03-28 12:45:45,091 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 200.13/159.36 [2019-03-28 12:45:45,091 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 200.13/159.36 [2019-03-28 12:45:45,092 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 200.13/159.36 [2019-03-28 12:45:45,092 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 200.13/159.36 [2019-03-28 12:45:45,092 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 200.13/159.36 [2019-03-28 12:45:45,092 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 200.13/159.36 [2019-03-28 12:45:45,118 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 200.13/159.36 [2019-03-28 12:45:45,131 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 200.13/159.36 [2019-03-28 12:45:45,134 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 200.13/159.36 [2019-03-28 12:45:45,136 INFO L271 PluginConnector]: Initializing CDTParser... 200.13/159.36 [2019-03-28 12:45:45,136 INFO L276 PluginConnector]: CDTParser initialized 200.13/159.36 [2019-03-28 12:45:45,137 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 200.13/159.36 [2019-03-28 12:45:45,249 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/70289136e02c4f0aa1c66970e7b0ed41/FLAG88a606d1a 200.13/159.36 [2019-03-28 12:45:45,586 INFO L307 CDTParser]: Found 1 translation units. 200.13/159.36 [2019-03-28 12:45:45,587 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 200.13/159.36 [2019-03-28 12:45:45,587 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 200.13/159.36 [2019-03-28 12:45:45,593 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/70289136e02c4f0aa1c66970e7b0ed41/FLAG88a606d1a 200.13/159.36 [2019-03-28 12:45:45,987 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/70289136e02c4f0aa1c66970e7b0ed41 200.13/159.36 [2019-03-28 12:45:45,999 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 200.13/159.36 [2019-03-28 12:45:46,001 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 200.13/159.36 [2019-03-28 12:45:46,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 200.13/159.36 [2019-03-28 12:45:46,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 200.13/159.36 [2019-03-28 12:45:46,005 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 200.13/159.36 [2019-03-28 12:45:46,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:45:45" (1/1) ... 200.13/159.36 [2019-03-28 12:45:46,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4219f1f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:46, skipping insertion in model container 200.13/159.36 [2019-03-28 12:45:46,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:45:45" (1/1) ... 200.13/159.36 [2019-03-28 12:45:46,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 200.13/159.36 [2019-03-28 12:45:46,035 INFO L176 MainTranslator]: Built tables and reachable declarations 200.13/159.36 [2019-03-28 12:45:46,199 INFO L206 PostProcessor]: Analyzing one entry point: main 200.13/159.36 [2019-03-28 12:45:46,212 INFO L191 MainTranslator]: Completed pre-run 200.13/159.36 [2019-03-28 12:45:46,295 INFO L206 PostProcessor]: Analyzing one entry point: main 200.13/159.36 [2019-03-28 12:45:46,312 INFO L195 MainTranslator]: Completed translation 200.13/159.36 [2019-03-28 12:45:46,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:46 WrapperNode 200.13/159.36 [2019-03-28 12:45:46,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 200.13/159.36 [2019-03-28 12:45:46,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 200.13/159.36 [2019-03-28 12:45:46,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 200.13/159.36 [2019-03-28 12:45:46,314 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 200.13/159.36 [2019-03-28 12:45:46,324 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) ... 200.13/159.36 [2019-03-28 12:45:46,333 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) ... 200.13/159.36 [2019-03-28 12:45:46,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 200.13/159.36 [2019-03-28 12:45:46,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 200.13/159.36 [2019-03-28 12:45:46,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 200.13/159.36 [2019-03-28 12:45:46,358 INFO L276 PluginConnector]: Boogie Preprocessor initialized 200.13/159.36 [2019-03-28 12:45:46,368 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) ... 200.13/159.36 [2019-03-28 12:45:46,368 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) ... 200.13/159.36 [2019-03-28 12:45:46,370 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) ... 200.13/159.36 [2019-03-28 12:45:46,371 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) ... 200.13/159.36 [2019-03-28 12:45:46,375 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) ... 200.13/159.36 [2019-03-28 12:45:46,380 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) ... 200.13/159.36 [2019-03-28 12:45:46,381 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) ... 200.13/159.36 [2019-03-28 12:45:46,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 200.13/159.36 [2019-03-28 12:45:46,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 200.13/159.36 [2019-03-28 12:45:46,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... 200.13/159.36 [2019-03-28 12:45:46,384 INFO L276 PluginConnector]: RCFGBuilder initialized 200.13/159.36 [2019-03-28 12:45:46,385 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) ... 200.13/159.36 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 200.13/159.36 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 200.13/159.36 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 200.13/159.36 [2019-03-28 12:45:46,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 200.13/159.36 [2019-03-28 12:45:46,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 200.13/159.36 [2019-03-28 12:45:46,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 200.13/159.36 [2019-03-28 12:45:46,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 200.13/159.36 [2019-03-28 12:45:46,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 200.13/159.36 [2019-03-28 12:45:46,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 200.13/159.36 [2019-03-28 12:45:46,798 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 200.13/159.36 [2019-03-28 12:45:46,799 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 200.13/159.36 [2019-03-28 12:45:46,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:46 BoogieIcfgContainer 200.13/159.36 [2019-03-28 12:45:46,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 200.13/159.36 [2019-03-28 12:45:46,801 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 200.13/159.36 [2019-03-28 12:45:46,801 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 200.13/159.36 [2019-03-28 12:45:46,803 INFO L276 PluginConnector]: BlockEncodingV2 initialized 200.13/159.36 [2019-03-28 12:45:46,804 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:46" (1/1) ... 200.13/159.36 [2019-03-28 12:45:46,822 INFO L313 BlockEncoder]: Initial Icfg 58 locations, 62 edges 200.13/159.36 [2019-03-28 12:45:46,824 INFO L258 BlockEncoder]: Using Remove infeasible edges 200.13/159.36 [2019-03-28 12:45:46,825 INFO L263 BlockEncoder]: Using Maximize final states 200.13/159.36 [2019-03-28 12:45:46,826 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 200.13/159.36 [2019-03-28 12:45:46,826 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 200.13/159.36 [2019-03-28 12:45:46,828 INFO L296 BlockEncoder]: Using Remove sink states 200.13/159.36 [2019-03-28 12:45:46,828 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 200.13/159.36 [2019-03-28 12:45:46,829 INFO L179 BlockEncoder]: Using Rewrite not-equals 200.13/159.36 [2019-03-28 12:45:46,857 INFO L185 BlockEncoder]: Using Use SBE 200.13/159.36 [2019-03-28 12:45:46,895 INFO L200 BlockEncoder]: SBE split 31 edges 200.13/159.36 [2019-03-28 12:45:46,901 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 200.13/159.36 [2019-03-28 12:45:46,902 INFO L71 MaximizeFinalStates]: 0 new accepting states 200.13/159.36 [2019-03-28 12:45:46,934 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 200.13/159.36 [2019-03-28 12:45:46,937 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 200.13/159.36 [2019-03-28 12:45:46,939 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 200.13/159.36 [2019-03-28 12:45:46,939 INFO L71 MaximizeFinalStates]: 0 new accepting states 200.13/159.36 [2019-03-28 12:45:46,939 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 200.13/159.36 [2019-03-28 12:45:46,940 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 200.13/159.36 [2019-03-28 12:45:46,940 INFO L313 BlockEncoder]: Encoded RCFG 50 locations, 90 edges 200.13/159.36 [2019-03-28 12:45:46,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:45:46 BasicIcfg 200.13/159.36 [2019-03-28 12:45:46,941 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 200.13/159.36 [2019-03-28 12:45:46,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 200.13/159.36 [2019-03-28 12:45:46,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... 200.13/159.36 [2019-03-28 12:45:46,946 INFO L276 PluginConnector]: TraceAbstraction initialized 200.13/159.36 [2019-03-28 12:45:46,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:45:45" (1/4) ... 200.13/159.36 [2019-03-28 12:45:46,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50da1b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:45:46, skipping insertion in model container 200.13/159.36 [2019-03-28 12:45:46,947 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) ... 200.13/159.36 [2019-03-28 12:45:46,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50da1b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:45:46, skipping insertion in model container 200.13/159.36 [2019-03-28 12:45:46,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:46" (3/4) ... 200.13/159.36 [2019-03-28 12:45:46,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50da1b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:45:46, skipping insertion in model container 200.13/159.36 [2019-03-28 12:45:46,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:45:46" (4/4) ... 200.13/159.36 [2019-03-28 12:45:46,950 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 200.13/159.36 [2019-03-28 12:45:46,960 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 200.13/159.36 [2019-03-28 12:45:46,968 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. 200.13/159.36 [2019-03-28 12:45:46,985 INFO L257 AbstractCegarLoop]: Starting to check reachability of 28 error locations. 200.13/159.36 [2019-03-28 12:45:47,014 INFO L133 ementStrategyFactory]: Using default assertion order modulation 200.13/159.36 [2019-03-28 12:45:47,015 INFO L382 AbstractCegarLoop]: Interprodecural is true 200.13/159.36 [2019-03-28 12:45:47,015 INFO L383 AbstractCegarLoop]: Hoare is true 200.13/159.36 [2019-03-28 12:45:47,015 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 200.13/159.36 [2019-03-28 12:45:47,015 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 200.13/159.36 [2019-03-28 12:45:47,015 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 200.13/159.36 [2019-03-28 12:45:47,016 INFO L387 AbstractCegarLoop]: Difference is false 200.13/159.36 [2019-03-28 12:45:47,016 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 200.13/159.36 [2019-03-28 12:45:47,016 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 200.13/159.36 [2019-03-28 12:45:47,032 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. 200.13/159.36 [2019-03-28 12:45:47,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 200.13/159.36 [2019-03-28 12:45:47,038 INFO L394 BasicCegarLoop]: Found error trace 200.13/159.36 [2019-03-28 12:45:47,038 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 200.13/159.36 [2019-03-28 12:45:47,039 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== 200.13/159.36 [2019-03-28 12:45:47,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.36 [2019-03-28 12:45:47,044 INFO L82 PathProgramCache]: Analyzing trace with hash 139347, now seen corresponding path program 1 times 200.13/159.36 [2019-03-28 12:45:47,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.13/159.36 [2019-03-28 12:45:47,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.13/159.36 [2019-03-28 12:45:47,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:47,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:47,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.13/159.36 [2019-03-28 12:45:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 200.13/159.36 [2019-03-28 12:45:47,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 200.13/159.36 [2019-03-28 12:45:47,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 200.13/159.36 [2019-03-28 12:45:47,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 200.13/159.36 [2019-03-28 12:45:47,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 200.13/159.36 [2019-03-28 12:45:47,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 200.13/159.36 [2019-03-28 12:45:47,262 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. 200.13/159.36 [2019-03-28 12:45:47,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 200.13/159.36 [2019-03-28 12:45:47,459 INFO L93 Difference]: Finished difference Result 50 states and 90 transitions. 200.13/159.36 [2019-03-28 12:45:47,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 200.13/159.36 [2019-03-28 12:45:47,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 200.13/159.36 [2019-03-28 12:45:47,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 200.13/159.36 [2019-03-28 12:45:47,502 INFO L225 Difference]: With dead ends: 50 200.13/159.36 [2019-03-28 12:45:47,503 INFO L226 Difference]: Without dead ends: 45 200.13/159.36 [2019-03-28 12:45:47,506 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 200.13/159.36 [2019-03-28 12:45:47,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. 200.13/159.36 [2019-03-28 12:45:47,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. 200.13/159.36 [2019-03-28 12:45:47,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. 200.13/159.36 [2019-03-28 12:45:47,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 80 transitions. 200.13/159.36 [2019-03-28 12:45:47,547 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 80 transitions. Word has length 3 200.13/159.36 [2019-03-28 12:45:47,548 INFO L84 Accepts]: Finished accepts. word is rejected. 200.13/159.36 [2019-03-28 12:45:47,548 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 80 transitions. 200.13/159.36 [2019-03-28 12:45:47,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 200.13/159.36 [2019-03-28 12:45:47,549 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 80 transitions. 200.13/159.36 [2019-03-28 12:45:47,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 200.13/159.36 [2019-03-28 12:45:47,549 INFO L394 BasicCegarLoop]: Found error trace 200.13/159.36 [2019-03-28 12:45:47,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 200.13/159.36 [2019-03-28 12:45:47,550 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== 200.13/159.36 [2019-03-28 12:45:47,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.36 [2019-03-28 12:45:47,550 INFO L82 PathProgramCache]: Analyzing trace with hash 139349, now seen corresponding path program 1 times 200.13/159.36 [2019-03-28 12:45:47,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.13/159.36 [2019-03-28 12:45:47,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.13/159.36 [2019-03-28 12:45:47,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:47,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:47,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.13/159.36 [2019-03-28 12:45:47,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 200.13/159.36 [2019-03-28 12:45:47,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 200.13/159.36 [2019-03-28 12:45:47,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 200.13/159.36 [2019-03-28 12:45:47,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 200.13/159.36 [2019-03-28 12:45:47,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 200.13/159.36 [2019-03-28 12:45:47,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 200.13/159.36 [2019-03-28 12:45:47,579 INFO L87 Difference]: Start difference. First operand 45 states and 80 transitions. Second operand 3 states. 200.13/159.36 [2019-03-28 12:45:47,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 200.13/159.36 [2019-03-28 12:45:47,703 INFO L93 Difference]: Finished difference Result 50 states and 80 transitions. 200.13/159.36 [2019-03-28 12:45:47,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 200.13/159.36 [2019-03-28 12:45:47,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 200.13/159.36 [2019-03-28 12:45:47,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 200.13/159.36 [2019-03-28 12:45:47,705 INFO L225 Difference]: With dead ends: 50 200.13/159.36 [2019-03-28 12:45:47,705 INFO L226 Difference]: Without dead ends: 45 200.13/159.36 [2019-03-28 12:45:47,707 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 200.13/159.36 [2019-03-28 12:45:47,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. 200.13/159.36 [2019-03-28 12:45:47,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. 200.13/159.36 [2019-03-28 12:45:47,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. 200.13/159.36 [2019-03-28 12:45:47,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 75 transitions. 200.13/159.36 [2019-03-28 12:45:47,713 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 75 transitions. Word has length 3 200.13/159.36 [2019-03-28 12:45:47,713 INFO L84 Accepts]: Finished accepts. word is rejected. 200.13/159.36 [2019-03-28 12:45:47,713 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 75 transitions. 200.13/159.36 [2019-03-28 12:45:47,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 200.13/159.36 [2019-03-28 12:45:47,714 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 75 transitions. 200.13/159.36 [2019-03-28 12:45:47,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 200.13/159.36 [2019-03-28 12:45:47,714 INFO L394 BasicCegarLoop]: Found error trace 200.13/159.36 [2019-03-28 12:45:47,714 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 200.13/159.36 [2019-03-28 12:45:47,714 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== 200.13/159.36 [2019-03-28 12:45:47,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.36 [2019-03-28 12:45:47,715 INFO L82 PathProgramCache]: Analyzing trace with hash 139350, now seen corresponding path program 1 times 200.13/159.36 [2019-03-28 12:45:47,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.13/159.36 [2019-03-28 12:45:47,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.13/159.36 [2019-03-28 12:45:47,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:47,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:47,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.13/159.36 [2019-03-28 12:45:47,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 200.13/159.36 [2019-03-28 12:45:47,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 200.13/159.36 [2019-03-28 12:45:47,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 200.13/159.36 [2019-03-28 12:45:47,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 200.13/159.36 [2019-03-28 12:45:47,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 200.13/159.36 [2019-03-28 12:45:47,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 200.13/159.36 [2019-03-28 12:45:47,758 INFO L87 Difference]: Start difference. First operand 45 states and 75 transitions. Second operand 3 states. 200.13/159.36 [2019-03-28 12:45:47,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 200.13/159.36 [2019-03-28 12:45:47,883 INFO L93 Difference]: Finished difference Result 45 states and 75 transitions. 200.13/159.36 [2019-03-28 12:45:47,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 200.13/159.36 [2019-03-28 12:45:47,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 200.13/159.36 [2019-03-28 12:45:47,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 200.13/159.36 [2019-03-28 12:45:47,884 INFO L225 Difference]: With dead ends: 45 200.13/159.36 [2019-03-28 12:45:47,885 INFO L226 Difference]: Without dead ends: 40 200.13/159.36 [2019-03-28 12:45:47,885 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 200.13/159.36 [2019-03-28 12:45:47,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. 200.13/159.36 [2019-03-28 12:45:47,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. 200.13/159.36 [2019-03-28 12:45:47,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. 200.13/159.36 [2019-03-28 12:45:47,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 70 transitions. 200.13/159.36 [2019-03-28 12:45:47,891 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 70 transitions. Word has length 3 200.13/159.36 [2019-03-28 12:45:47,891 INFO L84 Accepts]: Finished accepts. word is rejected. 200.13/159.36 [2019-03-28 12:45:47,891 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 70 transitions. 200.13/159.36 [2019-03-28 12:45:47,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 200.13/159.36 [2019-03-28 12:45:47,891 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 70 transitions. 200.13/159.36 [2019-03-28 12:45:47,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 200.13/159.36 [2019-03-28 12:45:47,892 INFO L394 BasicCegarLoop]: Found error trace 200.13/159.36 [2019-03-28 12:45:47,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 200.13/159.36 [2019-03-28 12:45:47,892 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== 200.13/159.36 [2019-03-28 12:45:47,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.36 [2019-03-28 12:45:47,893 INFO L82 PathProgramCache]: Analyzing trace with hash 4317035, now seen corresponding path program 1 times 200.13/159.36 [2019-03-28 12:45:47,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.13/159.36 [2019-03-28 12:45:47,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.13/159.36 [2019-03-28 12:45:47,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:47,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:47,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.13/159.36 [2019-03-28 12:45:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 200.13/159.36 [2019-03-28 12:45:47,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 200.13/159.36 [2019-03-28 12:45:47,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 200.13/159.36 [2019-03-28 12:45:47,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 200.13/159.36 [2019-03-28 12:45:47,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 200.13/159.36 [2019-03-28 12:45:47,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 200.13/159.36 [2019-03-28 12:45:47,933 INFO L87 Difference]: Start difference. First operand 40 states and 70 transitions. Second operand 3 states. 200.13/159.36 [2019-03-28 12:45:48,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 200.13/159.36 [2019-03-28 12:45:48,063 INFO L93 Difference]: Finished difference Result 40 states and 70 transitions. 200.13/159.36 [2019-03-28 12:45:48,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 200.13/159.36 [2019-03-28 12:45:48,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 200.13/159.36 [2019-03-28 12:45:48,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 200.13/159.36 [2019-03-28 12:45:48,066 INFO L225 Difference]: With dead ends: 40 200.13/159.36 [2019-03-28 12:45:48,066 INFO L226 Difference]: Without dead ends: 35 200.13/159.36 [2019-03-28 12:45:48,066 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 200.13/159.36 [2019-03-28 12:45:48,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. 200.13/159.36 [2019-03-28 12:45:48,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. 200.13/159.36 [2019-03-28 12:45:48,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. 200.13/159.36 [2019-03-28 12:45:48,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 60 transitions. 200.13/159.36 [2019-03-28 12:45:48,071 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 60 transitions. Word has length 4 200.13/159.36 [2019-03-28 12:45:48,071 INFO L84 Accepts]: Finished accepts. word is rejected. 200.13/159.36 [2019-03-28 12:45:48,072 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 60 transitions. 200.13/159.36 [2019-03-28 12:45:48,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 200.13/159.36 [2019-03-28 12:45:48,072 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 60 transitions. 200.13/159.36 [2019-03-28 12:45:48,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 200.13/159.36 [2019-03-28 12:45:48,072 INFO L394 BasicCegarLoop]: Found error trace 200.13/159.36 [2019-03-28 12:45:48,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 200.13/159.36 [2019-03-28 12:45:48,073 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== 200.13/159.36 [2019-03-28 12:45:48,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.36 [2019-03-28 12:45:48,073 INFO L82 PathProgramCache]: Analyzing trace with hash 4317037, now seen corresponding path program 1 times 200.13/159.36 [2019-03-28 12:45:48,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.13/159.36 [2019-03-28 12:45:48,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.13/159.36 [2019-03-28 12:45:48,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.13/159.36 [2019-03-28 12:45:48,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 200.13/159.36 [2019-03-28 12:45:48,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 200.13/159.36 [2019-03-28 12:45:48,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 200.13/159.36 [2019-03-28 12:45:48,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 200.13/159.36 [2019-03-28 12:45:48,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 200.13/159.36 [2019-03-28 12:45:48,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 200.13/159.36 [2019-03-28 12:45:48,101 INFO L87 Difference]: Start difference. First operand 35 states and 60 transitions. Second operand 3 states. 200.13/159.36 [2019-03-28 12:45:48,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 200.13/159.36 [2019-03-28 12:45:48,173 INFO L93 Difference]: Finished difference Result 40 states and 60 transitions. 200.13/159.36 [2019-03-28 12:45:48,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 200.13/159.36 [2019-03-28 12:45:48,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 200.13/159.36 [2019-03-28 12:45:48,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 200.13/159.36 [2019-03-28 12:45:48,174 INFO L225 Difference]: With dead ends: 40 200.13/159.36 [2019-03-28 12:45:48,174 INFO L226 Difference]: Without dead ends: 35 200.13/159.36 [2019-03-28 12:45:48,175 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 200.13/159.36 [2019-03-28 12:45:48,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. 200.13/159.36 [2019-03-28 12:45:48,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. 200.13/159.36 [2019-03-28 12:45:48,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. 200.13/159.36 [2019-03-28 12:45:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 55 transitions. 200.13/159.36 [2019-03-28 12:45:48,179 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 55 transitions. Word has length 4 200.13/159.36 [2019-03-28 12:45:48,180 INFO L84 Accepts]: Finished accepts. word is rejected. 200.13/159.36 [2019-03-28 12:45:48,180 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 55 transitions. 200.13/159.36 [2019-03-28 12:45:48,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 200.13/159.36 [2019-03-28 12:45:48,180 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 55 transitions. 200.13/159.36 [2019-03-28 12:45:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 200.13/159.36 [2019-03-28 12:45:48,180 INFO L394 BasicCegarLoop]: Found error trace 200.13/159.36 [2019-03-28 12:45:48,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 200.13/159.36 [2019-03-28 12:45:48,181 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== 200.13/159.36 [2019-03-28 12:45:48,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.36 [2019-03-28 12:45:48,181 INFO L82 PathProgramCache]: Analyzing trace with hash 4317038, now seen corresponding path program 1 times 200.13/159.36 [2019-03-28 12:45:48,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.13/159.36 [2019-03-28 12:45:48,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.13/159.36 [2019-03-28 12:45:48,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.13/159.36 [2019-03-28 12:45:48,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 200.13/159.36 [2019-03-28 12:45:48,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 200.13/159.36 [2019-03-28 12:45:48,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 200.13/159.36 [2019-03-28 12:45:48,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 200.13/159.36 [2019-03-28 12:45:48,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 200.13/159.36 [2019-03-28 12:45:48,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 200.13/159.36 [2019-03-28 12:45:48,217 INFO L87 Difference]: Start difference. First operand 35 states and 55 transitions. Second operand 3 states. 200.13/159.36 [2019-03-28 12:45:48,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 200.13/159.36 [2019-03-28 12:45:48,307 INFO L93 Difference]: Finished difference Result 35 states and 55 transitions. 200.13/159.36 [2019-03-28 12:45:48,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 200.13/159.36 [2019-03-28 12:45:48,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 200.13/159.36 [2019-03-28 12:45:48,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 200.13/159.36 [2019-03-28 12:45:48,308 INFO L225 Difference]: With dead ends: 35 200.13/159.36 [2019-03-28 12:45:48,308 INFO L226 Difference]: Without dead ends: 30 200.13/159.36 [2019-03-28 12:45:48,309 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 200.13/159.36 [2019-03-28 12:45:48,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 200.13/159.36 [2019-03-28 12:45:48,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. 200.13/159.36 [2019-03-28 12:45:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 200.13/159.36 [2019-03-28 12:45:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 50 transitions. 200.13/159.36 [2019-03-28 12:45:48,312 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 50 transitions. Word has length 4 200.13/159.36 [2019-03-28 12:45:48,313 INFO L84 Accepts]: Finished accepts. word is rejected. 200.13/159.36 [2019-03-28 12:45:48,313 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 50 transitions. 200.13/159.36 [2019-03-28 12:45:48,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 200.13/159.36 [2019-03-28 12:45:48,314 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 50 transitions. 200.13/159.36 [2019-03-28 12:45:48,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 200.13/159.36 [2019-03-28 12:45:48,314 INFO L394 BasicCegarLoop]: Found error trace 200.13/159.36 [2019-03-28 12:45:48,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 200.13/159.36 [2019-03-28 12:45:48,314 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== 200.13/159.36 [2019-03-28 12:45:48,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.36 [2019-03-28 12:45:48,315 INFO L82 PathProgramCache]: Analyzing trace with hash 133826514, now seen corresponding path program 1 times 200.13/159.36 [2019-03-28 12:45:48,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.13/159.36 [2019-03-28 12:45:48,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.13/159.36 [2019-03-28 12:45:48,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.13/159.36 [2019-03-28 12:45:48,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 200.13/159.36 [2019-03-28 12:45:48,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 200.13/159.36 [2019-03-28 12:45:48,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 200.13/159.36 [2019-03-28 12:45:48,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 200.13/159.36 [2019-03-28 12:45:48,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 200.13/159.36 [2019-03-28 12:45:48,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 200.13/159.36 [2019-03-28 12:45:48,343 INFO L87 Difference]: Start difference. First operand 30 states and 50 transitions. Second operand 3 states. 200.13/159.36 [2019-03-28 12:45:48,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 200.13/159.36 [2019-03-28 12:45:48,411 INFO L93 Difference]: Finished difference Result 30 states and 50 transitions. 200.13/159.36 [2019-03-28 12:45:48,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 200.13/159.36 [2019-03-28 12:45:48,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 200.13/159.36 [2019-03-28 12:45:48,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 200.13/159.36 [2019-03-28 12:45:48,413 INFO L225 Difference]: With dead ends: 30 200.13/159.36 [2019-03-28 12:45:48,413 INFO L226 Difference]: Without dead ends: 26 200.13/159.36 [2019-03-28 12:45:48,413 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 200.13/159.36 [2019-03-28 12:45:48,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 200.13/159.36 [2019-03-28 12:45:48,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 200.13/159.36 [2019-03-28 12:45:48,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 200.13/159.36 [2019-03-28 12:45:48,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 42 transitions. 200.13/159.36 [2019-03-28 12:45:48,417 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 42 transitions. Word has length 5 200.13/159.36 [2019-03-28 12:45:48,417 INFO L84 Accepts]: Finished accepts. word is rejected. 200.13/159.36 [2019-03-28 12:45:48,417 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 42 transitions. 200.13/159.36 [2019-03-28 12:45:48,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 200.13/159.36 [2019-03-28 12:45:48,417 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 42 transitions. 200.13/159.36 [2019-03-28 12:45:48,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 200.13/159.36 [2019-03-28 12:45:48,418 INFO L394 BasicCegarLoop]: Found error trace 200.13/159.36 [2019-03-28 12:45:48,418 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 200.13/159.36 [2019-03-28 12:45:48,418 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== 200.13/159.36 [2019-03-28 12:45:48,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.36 [2019-03-28 12:45:48,419 INFO L82 PathProgramCache]: Analyzing trace with hash 133826516, now seen corresponding path program 1 times 200.13/159.36 [2019-03-28 12:45:48,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.13/159.36 [2019-03-28 12:45:48,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.13/159.36 [2019-03-28 12:45:48,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.13/159.36 [2019-03-28 12:45:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 200.13/159.36 [2019-03-28 12:45:48,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 200.13/159.36 [2019-03-28 12:45:48,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 200.13/159.36 [2019-03-28 12:45:48,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 200.13/159.36 [2019-03-28 12:45:48,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 200.13/159.36 [2019-03-28 12:45:48,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 200.13/159.36 [2019-03-28 12:45:48,442 INFO L87 Difference]: Start difference. First operand 26 states and 42 transitions. Second operand 3 states. 200.13/159.36 [2019-03-28 12:45:48,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 200.13/159.36 [2019-03-28 12:45:48,483 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. 200.13/159.36 [2019-03-28 12:45:48,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 200.13/159.36 [2019-03-28 12:45:48,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 200.13/159.36 [2019-03-28 12:45:48,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 200.13/159.36 [2019-03-28 12:45:48,484 INFO L225 Difference]: With dead ends: 30 200.13/159.36 [2019-03-28 12:45:48,485 INFO L226 Difference]: Without dead ends: 26 200.13/159.36 [2019-03-28 12:45:48,486 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 200.13/159.36 [2019-03-28 12:45:48,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 200.13/159.36 [2019-03-28 12:45:48,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 200.13/159.36 [2019-03-28 12:45:48,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 200.13/159.36 [2019-03-28 12:45:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. 200.13/159.36 [2019-03-28 12:45:48,489 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 5 200.13/159.36 [2019-03-28 12:45:48,489 INFO L84 Accepts]: Finished accepts. word is rejected. 200.13/159.36 [2019-03-28 12:45:48,489 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. 200.13/159.36 [2019-03-28 12:45:48,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 200.13/159.36 [2019-03-28 12:45:48,489 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. 200.13/159.36 [2019-03-28 12:45:48,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 200.13/159.36 [2019-03-28 12:45:48,490 INFO L394 BasicCegarLoop]: Found error trace 200.13/159.36 [2019-03-28 12:45:48,490 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 200.13/159.36 [2019-03-28 12:45:48,490 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== 200.13/159.36 [2019-03-28 12:45:48,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.36 [2019-03-28 12:45:48,490 INFO L82 PathProgramCache]: Analyzing trace with hash 133826517, now seen corresponding path program 1 times 200.13/159.36 [2019-03-28 12:45:48,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.13/159.36 [2019-03-28 12:45:48,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.13/159.36 [2019-03-28 12:45:48,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.13/159.36 [2019-03-28 12:45:48,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 200.13/159.36 [2019-03-28 12:45:48,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 200.13/159.36 [2019-03-28 12:45:48,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 200.13/159.36 [2019-03-28 12:45:48,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 200.13/159.36 [2019-03-28 12:45:48,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 200.13/159.36 [2019-03-28 12:45:48,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 200.13/159.36 [2019-03-28 12:45:48,520 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 3 states. 200.13/159.36 [2019-03-28 12:45:48,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 200.13/159.36 [2019-03-28 12:45:48,579 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. 200.13/159.36 [2019-03-28 12:45:48,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 200.13/159.36 [2019-03-28 12:45:48,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 200.13/159.36 [2019-03-28 12:45:48,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 200.13/159.36 [2019-03-28 12:45:48,580 INFO L225 Difference]: With dead ends: 26 200.13/159.36 [2019-03-28 12:45:48,580 INFO L226 Difference]: Without dead ends: 0 200.13/159.36 [2019-03-28 12:45:48,580 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 200.13/159.36 [2019-03-28 12:45:48,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 200.13/159.36 [2019-03-28 12:45:48,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 200.13/159.36 [2019-03-28 12:45:48,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 200.13/159.36 [2019-03-28 12:45:48,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 200.13/159.36 [2019-03-28 12:45:48,581 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 200.13/159.36 [2019-03-28 12:45:48,582 INFO L84 Accepts]: Finished accepts. word is rejected. 200.13/159.36 [2019-03-28 12:45:48,582 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 200.13/159.36 [2019-03-28 12:45:48,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 200.13/159.36 [2019-03-28 12:45:48,582 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 200.13/159.36 [2019-03-28 12:45:48,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 200.13/159.36 [2019-03-28 12:45:48,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 200.13/159.36 [2019-03-28 12:45:48,616 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,617 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,617 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,617 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,617 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,617 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,617 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,617 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,618 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,618 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,618 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,618 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,618 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,618 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,618 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,619 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,619 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,619 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,619 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,619 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,619 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,619 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,619 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,620 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,620 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,620 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,620 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,620 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,620 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 17 21) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,620 INFO L448 ceAbstractionStarter]: For program point L17-3(lines 14 22) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,620 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,620 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,621 INFO L448 ceAbstractionStarter]: For program point L13-3(line 13) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,621 INFO L448 ceAbstractionStarter]: For program point L13-4(line 13) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,621 INFO L448 ceAbstractionStarter]: For program point L13-5(lines 13 24) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,621 INFO L444 ceAbstractionStarter]: At program point L13-7(lines 12 24) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base))) 200.13/159.36 [2019-03-28 12:45:48,622 INFO L448 ceAbstractionStarter]: For program point L13-8(lines 13 24) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,622 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,622 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,622 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,622 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,622 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,623 INFO L448 ceAbstractionStarter]: For program point L14-1(lines 14 22) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,623 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,623 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,623 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,623 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,623 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,623 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,623 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 200.13/159.36 [2019-03-28 12:45:48,624 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 200.13/159.36 [2019-03-28 12:45:48,633 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 200.13/159.36 [2019-03-28 12:45:48,634 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 200.13/159.36 [2019-03-28 12:45:48,634 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 200.13/159.36 [2019-03-28 12:45:48,640 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 200.13/159.36 [2019-03-28 12:45:48,640 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 200.13/159.36 [2019-03-28 12:45:48,640 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 200.13/159.36 [2019-03-28 12:45:48,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:45:48 BasicIcfg 200.13/159.36 [2019-03-28 12:45:48,643 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 200.13/159.36 [2019-03-28 12:45:48,644 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 200.13/159.36 [2019-03-28 12:45:48,644 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 200.13/159.36 [2019-03-28 12:45:48,647 INFO L276 PluginConnector]: BuchiAutomizer initialized 200.13/159.36 [2019-03-28 12:45:48,648 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 200.13/159.36 [2019-03-28 12:45:48,648 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:45:45" (1/5) ... 200.13/159.36 [2019-03-28 12:45:48,649 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3dba7e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:45:48, skipping insertion in model container 200.13/159.36 [2019-03-28 12:45:48,649 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 200.13/159.36 [2019-03-28 12:45:48,649 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) ... 200.13/159.36 [2019-03-28 12:45:48,649 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3dba7e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:45:48, skipping insertion in model container 200.13/159.36 [2019-03-28 12:45:48,649 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 200.13/159.36 [2019-03-28 12:45:48,649 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:46" (3/5) ... 200.13/159.36 [2019-03-28 12:45:48,650 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3dba7e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:45:48, skipping insertion in model container 200.13/159.36 [2019-03-28 12:45:48,650 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 200.13/159.36 [2019-03-28 12:45:48,650 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:45:46" (4/5) ... 200.13/159.36 [2019-03-28 12:45:48,650 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3dba7e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:45:48, skipping insertion in model container 200.13/159.36 [2019-03-28 12:45:48,650 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 200.13/159.36 [2019-03-28 12:45:48,650 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:45:48" (5/5) ... 200.13/159.36 [2019-03-28 12:45:48,652 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 200.13/159.36 [2019-03-28 12:45:48,673 INFO L133 ementStrategyFactory]: Using default assertion order modulation 200.13/159.36 [2019-03-28 12:45:48,673 INFO L374 BuchiCegarLoop]: Interprodecural is true 200.13/159.36 [2019-03-28 12:45:48,673 INFO L375 BuchiCegarLoop]: Hoare is true 200.13/159.36 [2019-03-28 12:45:48,673 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 200.13/159.36 [2019-03-28 12:45:48,673 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 200.13/159.36 [2019-03-28 12:45:48,673 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 200.13/159.36 [2019-03-28 12:45:48,673 INFO L379 BuchiCegarLoop]: Difference is false 200.13/159.36 [2019-03-28 12:45:48,674 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 200.13/159.36 [2019-03-28 12:45:48,674 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 200.13/159.36 [2019-03-28 12:45:48,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. 200.13/159.36 [2019-03-28 12:45:48,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 200.13/159.36 [2019-03-28 12:45:48,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 200.13/159.36 [2019-03-28 12:45:48,684 INFO L119 BuchiIsEmpty]: Starting construction of run 200.13/159.36 [2019-03-28 12:45:48,688 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 200.13/159.36 [2019-03-28 12:45:48,689 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 200.13/159.36 [2019-03-28 12:45:48,689 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 200.13/159.36 [2019-03-28 12:45:48,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. 200.13/159.36 [2019-03-28 12:45:48,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 200.13/159.36 [2019-03-28 12:45:48,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 200.13/159.36 [2019-03-28 12:45:48,691 INFO L119 BuchiIsEmpty]: Starting construction of run 200.13/159.36 [2019-03-28 12:45:48,692 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 200.13/159.36 [2019-03-28 12:45:48,692 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 200.13/159.36 [2019-03-28 12:45:48,697 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue [108] 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] 7#L-1true [187] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 9#L10true [94] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 45#L10-1true [135] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 24#L11true [109] L11-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 30#L13-7true 200.13/159.36 [2019-03-28 12:45:48,699 INFO L796 eck$LassoCheckResult]: Loop: 30#L13-7true [120] L13-7-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 50#L13true [208] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (>= 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 49#L13-1true [141] L13-1-->L13-5: Formula: |v_ULTIMATE.start_test_fun_#t~short5_3| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} AuxVars[] AssignedVars[] 31#L13-5true [124] L13-5-->L14: Formula: |v_ULTIMATE.start_test_fun_#t~short5_9| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 15#L14true [101] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{#valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 13#L14-1true [97] L14-1-->L15: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem6_4|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_4|} OutVars{ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 17#L15true [105] L15-->L15-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_17|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_17|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 26#L15-1true [252] L15-1-->L17-3: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) 1) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_18 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| (- 1)))) |v_#memory_int_25|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~x_ref~0.base_18))) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_37|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_37|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 51#L17-3true [144] L17-3-->L23: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 37#L23true [254] L23-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1))) |v_#memory_int_29|)) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 30#L13-7true 200.13/159.36 [2019-03-28 12:45:48,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.36 [2019-03-28 12:45:48,700 INFO L82 PathProgramCache]: Analyzing trace with hash 134034964, now seen corresponding path program 1 times 200.13/159.36 [2019-03-28 12:45:48,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.13/159.36 [2019-03-28 12:45:48,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.13/159.36 [2019-03-28 12:45:48,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.13/159.36 [2019-03-28 12:45:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.13/159.36 [2019-03-28 12:45:48,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.36 [2019-03-28 12:45:48,750 INFO L82 PathProgramCache]: Analyzing trace with hash 391787109, now seen corresponding path program 1 times 200.13/159.36 [2019-03-28 12:45:48,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.13/159.36 [2019-03-28 12:45:48,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.13/159.36 [2019-03-28 12:45:48,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.13/159.36 [2019-03-28 12:45:48,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 200.13/159.36 [2019-03-28 12:45:48,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 200.13/159.36 [2019-03-28 12:45:48,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 200.13/159.36 [2019-03-28 12:45:48,763 INFO L811 eck$LassoCheckResult]: loop already infeasible 200.13/159.36 [2019-03-28 12:45:48,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 200.13/159.36 [2019-03-28 12:45:48,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 200.13/159.36 [2019-03-28 12:45:48,764 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. 200.13/159.36 [2019-03-28 12:45:48,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 200.13/159.36 [2019-03-28 12:45:48,905 INFO L93 Difference]: Finished difference Result 52 states and 92 transitions. 200.13/159.36 [2019-03-28 12:45:48,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 200.13/159.36 [2019-03-28 12:45:48,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 92 transitions. 200.13/159.36 [2019-03-28 12:45:48,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 200.13/159.36 [2019-03-28 12:45:48,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 22 states and 33 transitions. 200.13/159.36 [2019-03-28 12:45:48,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 200.13/159.36 [2019-03-28 12:45:48,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 200.13/159.36 [2019-03-28 12:45:48,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 33 transitions. 200.13/159.36 [2019-03-28 12:45:48,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 200.13/159.36 [2019-03-28 12:45:48,914 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. 200.13/159.36 [2019-03-28 12:45:48,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 33 transitions. 200.13/159.36 [2019-03-28 12:45:48,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 200.13/159.36 [2019-03-28 12:45:48,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 200.13/159.36 [2019-03-28 12:45:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. 200.13/159.36 [2019-03-28 12:45:48,917 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. 200.13/159.36 [2019-03-28 12:45:48,917 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. 200.13/159.36 [2019-03-28 12:45:48,917 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 200.13/159.36 [2019-03-28 12:45:48,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 33 transitions. 200.13/159.36 [2019-03-28 12:45:48,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 200.13/159.36 [2019-03-28 12:45:48,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 200.13/159.36 [2019-03-28 12:45:48,918 INFO L119 BuchiIsEmpty]: Starting construction of run 200.13/159.36 [2019-03-28 12:45:48,919 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 200.13/159.36 [2019-03-28 12:45:48,919 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 200.13/159.36 [2019-03-28 12:45:48,920 INFO L794 eck$LassoCheckResult]: Stem: 128#ULTIMATE.startENTRY [108] 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] 125#L-1 [187] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 126#L10 [94] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 123#L10-1 [135] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 124#L11 [109] L11-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 116#L13-7 200.13/159.36 [2019-03-28 12:45:48,920 INFO L796 eck$LassoCheckResult]: Loop: 116#L13-7 [120] L13-7-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 117#L13 [209] L13-->L13-1: Formula: (and (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short5_2|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 131#L13-1 [141] L13-1-->L13-5: Formula: |v_ULTIMATE.start_test_fun_#t~short5_3| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} AuxVars[] AssignedVars[] 120#L13-5 [124] L13-5-->L14: Formula: |v_ULTIMATE.start_test_fun_#t~short5_9| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 121#L14 [101] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{#valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 132#L14-1 [164] L14-1-->L17: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem6_6|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 119#L17 [132] L17-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem8_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_23|} OutVars{#valid=|v_#valid_23|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 113#L17-1 [171] L17-1-->L17-3: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem8_6|) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 115#L17-3 [144] L17-3-->L23: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 130#L23 [254] L23-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1))) |v_#memory_int_29|)) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 116#L13-7 200.13/159.36 [2019-03-28 12:45:48,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.36 [2019-03-28 12:45:48,921 INFO L82 PathProgramCache]: Analyzing trace with hash 134034964, now seen corresponding path program 2 times 200.13/159.36 [2019-03-28 12:45:48,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.13/159.36 [2019-03-28 12:45:48,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.13/159.36 [2019-03-28 12:45:48,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.13/159.36 [2019-03-28 12:45:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.13/159.36 [2019-03-28 12:45:48,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.36 [2019-03-28 12:45:48,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1353064931, now seen corresponding path program 1 times 200.13/159.36 [2019-03-28 12:45:48,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.13/159.36 [2019-03-28 12:45:48,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.13/159.36 [2019-03-28 12:45:48,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 200.13/159.36 [2019-03-28 12:45:48,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.13/159.37 [2019-03-28 12:45:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 200.13/159.37 [2019-03-28 12:45:48,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 200.13/159.37 [2019-03-28 12:45:48,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 200.13/159.37 [2019-03-28 12:45:48,981 INFO L811 eck$LassoCheckResult]: loop already infeasible 200.13/159.37 [2019-03-28 12:45:48,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 200.13/159.37 [2019-03-28 12:45:48,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 200.13/159.37 [2019-03-28 12:45:48,982 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. cyclomatic complexity: 12 Second operand 5 states. 200.13/159.37 [2019-03-28 12:45:49,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 200.13/159.37 [2019-03-28 12:45:49,092 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. 200.13/159.37 [2019-03-28 12:45:49,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 200.13/159.37 [2019-03-28 12:45:49,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 40 transitions. 200.13/159.37 [2019-03-28 12:45:49,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 200.13/159.37 [2019-03-28 12:45:49,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 40 transitions. 200.13/159.37 [2019-03-28 12:45:49,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 200.13/159.37 [2019-03-28 12:45:49,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 200.13/159.37 [2019-03-28 12:45:49,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 40 transitions. 200.13/159.37 [2019-03-28 12:45:49,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 200.13/159.37 [2019-03-28 12:45:49,095 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 40 transitions. 200.13/159.37 [2019-03-28 12:45:49,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 40 transitions. 200.13/159.37 [2019-03-28 12:45:49,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. 200.13/159.37 [2019-03-28 12:45:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 200.13/159.37 [2019-03-28 12:45:49,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. 200.13/159.37 [2019-03-28 12:45:49,097 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. 200.13/159.37 [2019-03-28 12:45:49,097 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. 200.13/159.37 [2019-03-28 12:45:49,097 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 200.13/159.37 [2019-03-28 12:45:49,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 38 transitions. 200.13/159.37 [2019-03-28 12:45:49,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 200.13/159.37 [2019-03-28 12:45:49,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 200.13/159.37 [2019-03-28 12:45:49,098 INFO L119 BuchiIsEmpty]: Starting construction of run 200.13/159.37 [2019-03-28 12:45:49,099 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 200.13/159.37 [2019-03-28 12:45:49,099 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 200.13/159.37 [2019-03-28 12:45:49,100 INFO L794 eck$LassoCheckResult]: Stem: 191#ULTIMATE.startENTRY [108] 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] 188#L-1 [187] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 189#L10 [94] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 185#L10-1 [135] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 186#L11 [109] L11-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 179#L13-7 200.13/159.37 [2019-03-28 12:45:49,100 INFO L796 eck$LassoCheckResult]: Loop: 179#L13-7 [120] L13-7-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 180#L13 [209] L13-->L13-1: Formula: (and (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short5_2|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 195#L13-1 [141] L13-1-->L13-5: Formula: |v_ULTIMATE.start_test_fun_#t~short5_3| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} AuxVars[] AssignedVars[] 183#L13-5 [124] L13-5-->L14: Formula: |v_ULTIMATE.start_test_fun_#t~short5_9| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 184#L14 [101] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{#valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 196#L14-1 [97] L14-1-->L15: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem6_4|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_4|} OutVars{ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 174#L15 [105] L15-->L15-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_17|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_17|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 175#L15-1 [252] L15-1-->L17-3: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) 1) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_18 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| (- 1)))) |v_#memory_int_25|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~x_ref~0.base_18))) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_37|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_37|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 178#L17-3 [144] L17-3-->L23: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 194#L23 [254] L23-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1))) |v_#memory_int_29|)) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 179#L13-7 200.13/159.37 [2019-03-28 12:45:49,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.37 [2019-03-28 12:45:49,101 INFO L82 PathProgramCache]: Analyzing trace with hash 134034964, now seen corresponding path program 3 times 200.13/159.37 [2019-03-28 12:45:49,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.13/159.37 [2019-03-28 12:45:49,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.13/159.37 [2019-03-28 12:45:49,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:49,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:49,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.13/159.37 [2019-03-28 12:45:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.13/159.37 [2019-03-28 12:45:49,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.37 [2019-03-28 12:45:49,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1415667354, now seen corresponding path program 1 times 200.13/159.37 [2019-03-28 12:45:49,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.13/159.37 [2019-03-28 12:45:49,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.13/159.37 [2019-03-28 12:45:49,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:49,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:49,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.13/159.37 [2019-03-28 12:45:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.13/159.37 [2019-03-28 12:45:49,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.37 [2019-03-28 12:45:49,141 INFO L82 PathProgramCache]: Analyzing trace with hash -435577927, now seen corresponding path program 1 times 200.13/159.37 [2019-03-28 12:45:49,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.13/159.37 [2019-03-28 12:45:49,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.13/159.37 [2019-03-28 12:45:49,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:49,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:49,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.13/159.37 [2019-03-28 12:45:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.13/159.37 [2019-03-28 12:45:49,612 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 200.13/159.37 [2019-03-28 12:45:49,756 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 82 200.13/159.37 [2019-03-28 12:45:49,771 INFO L216 LassoAnalysis]: Preferences: 200.13/159.37 [2019-03-28 12:45:49,772 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 200.13/159.37 [2019-03-28 12:45:49,772 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 200.13/159.37 [2019-03-28 12:45:49,772 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 200.13/159.37 [2019-03-28 12:45:49,773 INFO L127 ssoRankerPreferences]: Use exernal solver: false 200.13/159.37 [2019-03-28 12:45:49,773 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 200.13/159.37 [2019-03-28 12:45:49,773 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 200.13/159.37 [2019-03-28 12:45:49,773 INFO L130 ssoRankerPreferences]: Path of dumped script: 200.13/159.37 [2019-03-28 12:45:49,773 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 200.13/159.37 [2019-03-28 12:45:49,773 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 200.13/159.37 [2019-03-28 12:45:49,774 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 200.13/159.37 [2019-03-28 12:45:49,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:49,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:49,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:49,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:49,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:49,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:49,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:49,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:49,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:49,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:49,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:49,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:49,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:50,148 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 200.13/159.37 [2019-03-28 12:45:50,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:50,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:50,649 INFO L300 LassoAnalysis]: Preprocessing complete. 200.13/159.37 [2019-03-28 12:45:50,655 INFO L497 LassoAnalysis]: Using template 'affine'. 200.13/159.37 [2019-03-28 12:45:50,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.13/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.13/159.37 Number of strict supporting invariants: 0 200.13/159.37 Number of non-strict supporting invariants: 1 200.13/159.37 Consider only non-deceasing supporting invariants: true 200.13/159.37 Simplify termination arguments: true 200.13/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.13/159.37 [2019-03-28 12:45:50,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.13/159.37 [2019-03-28 12:45:50,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 200.13/159.37 [2019-03-28 12:45:50,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.13/159.37 [2019-03-28 12:45:50,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.13/159.37 [2019-03-28 12:45:50,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.13/159.37 [2019-03-28 12:45:50,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 200.13/159.37 [2019-03-28 12:45:50,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 200.13/159.37 [2019-03-28 12:45:50,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.13/159.37 [2019-03-28 12:45:50,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.13/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.13/159.37 Number of strict supporting invariants: 0 200.13/159.37 Number of non-strict supporting invariants: 1 200.13/159.37 Consider only non-deceasing supporting invariants: true 200.13/159.37 Simplify termination arguments: true 200.13/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.13/159.37 [2019-03-28 12:45:50,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.13/159.37 [2019-03-28 12:45:50,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 200.13/159.37 [2019-03-28 12:45:50,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.13/159.37 [2019-03-28 12:45:50,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.13/159.37 [2019-03-28 12:45:50,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.13/159.37 [2019-03-28 12:45:50,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 200.13/159.37 [2019-03-28 12:45:50,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 200.13/159.37 [2019-03-28 12:45:50,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.13/159.37 [2019-03-28 12:45:50,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.13/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.13/159.37 Number of strict supporting invariants: 0 200.13/159.37 Number of non-strict supporting invariants: 1 200.13/159.37 Consider only non-deceasing supporting invariants: true 200.13/159.37 Simplify termination arguments: true 200.13/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.13/159.37 [2019-03-28 12:45:50,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.13/159.37 [2019-03-28 12:45:50,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 200.13/159.37 [2019-03-28 12:45:50,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.13/159.37 [2019-03-28 12:45:50,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.13/159.37 [2019-03-28 12:45:50,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.13/159.37 [2019-03-28 12:45:50,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 200.13/159.37 [2019-03-28 12:45:50,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 200.13/159.37 [2019-03-28 12:45:50,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.13/159.37 [2019-03-28 12:45:50,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.13/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.13/159.37 Number of strict supporting invariants: 0 200.13/159.37 Number of non-strict supporting invariants: 1 200.13/159.37 Consider only non-deceasing supporting invariants: true 200.13/159.37 Simplify termination arguments: true 200.13/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.13/159.37 [2019-03-28 12:45:50,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.13/159.37 [2019-03-28 12:45:50,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 200.13/159.37 [2019-03-28 12:45:50,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.13/159.37 [2019-03-28 12:45:50,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.13/159.37 [2019-03-28 12:45:50,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.13/159.37 [2019-03-28 12:45:50,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 200.13/159.37 [2019-03-28 12:45:50,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 200.13/159.37 [2019-03-28 12:45:50,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.13/159.37 [2019-03-28 12:45:50,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.13/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.13/159.37 Number of strict supporting invariants: 0 200.13/159.37 Number of non-strict supporting invariants: 1 200.13/159.37 Consider only non-deceasing supporting invariants: true 200.13/159.37 Simplify termination arguments: true 200.13/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.13/159.37 [2019-03-28 12:45:50,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.13/159.37 [2019-03-28 12:45:50,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 200.13/159.37 [2019-03-28 12:45:50,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.13/159.37 [2019-03-28 12:45:50,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.13/159.37 [2019-03-28 12:45:50,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.13/159.37 [2019-03-28 12:45:50,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 200.13/159.37 [2019-03-28 12:45:50,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 200.13/159.37 [2019-03-28 12:45:50,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.13/159.37 [2019-03-28 12:45:50,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.13/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.13/159.37 Number of strict supporting invariants: 0 200.13/159.37 Number of non-strict supporting invariants: 1 200.13/159.37 Consider only non-deceasing supporting invariants: true 200.13/159.37 Simplify termination arguments: true 200.13/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.13/159.37 [2019-03-28 12:45:50,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.13/159.37 [2019-03-28 12:45:50,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 200.13/159.37 [2019-03-28 12:45:50,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.13/159.37 [2019-03-28 12:45:50,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.13/159.37 [2019-03-28 12:45:50,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.13/159.37 [2019-03-28 12:45:50,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 200.13/159.37 [2019-03-28 12:45:50,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 200.13/159.37 [2019-03-28 12:45:50,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.13/159.37 [2019-03-28 12:45:50,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.13/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.13/159.37 Number of strict supporting invariants: 0 200.13/159.37 Number of non-strict supporting invariants: 1 200.13/159.37 Consider only non-deceasing supporting invariants: true 200.13/159.37 Simplify termination arguments: true 200.13/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.13/159.37 [2019-03-28 12:45:50,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.13/159.37 [2019-03-28 12:45:50,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 200.13/159.37 [2019-03-28 12:45:50,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.13/159.37 [2019-03-28 12:45:50,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.13/159.37 [2019-03-28 12:45:50,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.13/159.37 [2019-03-28 12:45:50,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 200.13/159.37 [2019-03-28 12:45:50,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 200.13/159.37 [2019-03-28 12:45:50,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.13/159.37 [2019-03-28 12:45:50,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.13/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.13/159.37 Number of strict supporting invariants: 0 200.13/159.37 Number of non-strict supporting invariants: 1 200.13/159.37 Consider only non-deceasing supporting invariants: true 200.13/159.37 Simplify termination arguments: true 200.13/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.13/159.37 [2019-03-28 12:45:50,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.13/159.37 [2019-03-28 12:45:50,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.13/159.37 [2019-03-28 12:45:50,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.13/159.37 [2019-03-28 12:45:50,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.13/159.37 [2019-03-28 12:45:50,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.13/159.37 [2019-03-28 12:45:50,685 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.13/159.37 [2019-03-28 12:45:50,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.13/159.37 [2019-03-28 12:45:50,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.13/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.13/159.37 Number of strict supporting invariants: 0 200.13/159.37 Number of non-strict supporting invariants: 1 200.13/159.37 Consider only non-deceasing supporting invariants: true 200.13/159.37 Simplify termination arguments: true 200.13/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.13/159.37 [2019-03-28 12:45:50,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.13/159.37 [2019-03-28 12:45:50,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 200.13/159.37 [2019-03-28 12:45:50,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.13/159.37 [2019-03-28 12:45:50,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.13/159.37 [2019-03-28 12:45:50,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.13/159.37 [2019-03-28 12:45:50,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 200.13/159.37 [2019-03-28 12:45:50,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 200.13/159.37 [2019-03-28 12:45:50,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.13/159.37 [2019-03-28 12:45:50,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.13/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.13/159.37 Number of strict supporting invariants: 0 200.13/159.37 Number of non-strict supporting invariants: 1 200.13/159.37 Consider only non-deceasing supporting invariants: true 200.13/159.37 Simplify termination arguments: true 200.13/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.13/159.37 [2019-03-28 12:45:50,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.13/159.37 [2019-03-28 12:45:50,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.13/159.37 [2019-03-28 12:45:50,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.13/159.37 [2019-03-28 12:45:50,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.13/159.37 [2019-03-28 12:45:50,694 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.13/159.37 [2019-03-28 12:45:50,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.13/159.37 [2019-03-28 12:45:50,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.13/159.37 [2019-03-28 12:45:50,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.13/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.13/159.37 Number of strict supporting invariants: 0 200.13/159.37 Number of non-strict supporting invariants: 1 200.13/159.37 Consider only non-deceasing supporting invariants: true 200.13/159.37 Simplify termination arguments: true 200.13/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.13/159.37 [2019-03-28 12:45:50,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.13/159.37 [2019-03-28 12:45:50,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 200.13/159.37 [2019-03-28 12:45:50,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.13/159.37 [2019-03-28 12:45:50,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.13/159.37 [2019-03-28 12:45:50,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.13/159.37 [2019-03-28 12:45:50,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 200.13/159.37 [2019-03-28 12:45:50,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 200.13/159.37 [2019-03-28 12:45:50,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.13/159.37 [2019-03-28 12:45:50,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.13/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.13/159.37 Number of strict supporting invariants: 0 200.13/159.37 Number of non-strict supporting invariants: 1 200.13/159.37 Consider only non-deceasing supporting invariants: true 200.13/159.37 Simplify termination arguments: true 200.13/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.13/159.37 [2019-03-28 12:45:50,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.13/159.37 [2019-03-28 12:45:50,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 200.13/159.37 [2019-03-28 12:45:50,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.13/159.37 [2019-03-28 12:45:50,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.13/159.37 [2019-03-28 12:45:50,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.13/159.37 [2019-03-28 12:45:50,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 200.13/159.37 [2019-03-28 12:45:50,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 200.13/159.37 [2019-03-28 12:45:50,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.13/159.37 [2019-03-28 12:45:50,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.13/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.13/159.37 Number of strict supporting invariants: 0 200.13/159.37 Number of non-strict supporting invariants: 1 200.13/159.37 Consider only non-deceasing supporting invariants: true 200.13/159.37 Simplify termination arguments: true 200.13/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.13/159.37 [2019-03-28 12:45:50,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.13/159.37 [2019-03-28 12:45:50,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.13/159.37 [2019-03-28 12:45:50,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.13/159.37 [2019-03-28 12:45:50,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.13/159.37 [2019-03-28 12:45:50,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.13/159.37 [2019-03-28 12:45:50,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.13/159.37 [2019-03-28 12:45:50,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.13/159.37 [2019-03-28 12:45:50,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.13/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.13/159.37 Number of strict supporting invariants: 0 200.13/159.37 Number of non-strict supporting invariants: 1 200.13/159.37 Consider only non-deceasing supporting invariants: true 200.13/159.37 Simplify termination arguments: true 200.13/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.13/159.37 [2019-03-28 12:45:50,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.13/159.37 [2019-03-28 12:45:50,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.13/159.37 [2019-03-28 12:45:50,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.13/159.37 [2019-03-28 12:45:50,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.13/159.37 [2019-03-28 12:45:50,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.13/159.37 [2019-03-28 12:45:50,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.13/159.37 [2019-03-28 12:45:50,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.13/159.37 [2019-03-28 12:45:50,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.13/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.13/159.37 Number of strict supporting invariants: 0 200.13/159.37 Number of non-strict supporting invariants: 1 200.13/159.37 Consider only non-deceasing supporting invariants: true 200.13/159.37 Simplify termination arguments: true 200.13/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.13/159.37 [2019-03-28 12:45:50,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.13/159.37 [2019-03-28 12:45:50,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.13/159.37 [2019-03-28 12:45:50,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.13/159.37 [2019-03-28 12:45:50,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.13/159.37 [2019-03-28 12:45:50,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.13/159.37 [2019-03-28 12:45:50,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.13/159.37 [2019-03-28 12:45:50,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.13/159.37 [2019-03-28 12:45:50,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.13/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.13/159.37 Number of strict supporting invariants: 0 200.13/159.37 Number of non-strict supporting invariants: 1 200.13/159.37 Consider only non-deceasing supporting invariants: true 200.13/159.37 Simplify termination arguments: true 200.13/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.13/159.37 [2019-03-28 12:45:50,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.13/159.37 [2019-03-28 12:45:50,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.13/159.37 [2019-03-28 12:45:50,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.13/159.37 [2019-03-28 12:45:50,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.13/159.37 [2019-03-28 12:45:50,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.13/159.37 [2019-03-28 12:45:50,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.13/159.37 [2019-03-28 12:45:50,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.13/159.37 [2019-03-28 12:45:50,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.13/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.13/159.37 Number of strict supporting invariants: 0 200.13/159.37 Number of non-strict supporting invariants: 1 200.13/159.37 Consider only non-deceasing supporting invariants: true 200.13/159.37 Simplify termination arguments: true 200.13/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.13/159.37 [2019-03-28 12:45:50,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.13/159.37 [2019-03-28 12:45:50,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.13/159.37 [2019-03-28 12:45:50,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.13/159.37 [2019-03-28 12:45:50,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.13/159.37 [2019-03-28 12:45:50,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.13/159.37 [2019-03-28 12:45:50,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.13/159.37 [2019-03-28 12:45:50,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.13/159.37 [2019-03-28 12:45:50,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.13/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.13/159.37 Number of strict supporting invariants: 0 200.13/159.37 Number of non-strict supporting invariants: 1 200.13/159.37 Consider only non-deceasing supporting invariants: true 200.13/159.37 Simplify termination arguments: true 200.13/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.13/159.37 [2019-03-28 12:45:50,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.13/159.37 [2019-03-28 12:45:50,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.13/159.37 [2019-03-28 12:45:50,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.13/159.37 [2019-03-28 12:45:50,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.13/159.37 [2019-03-28 12:45:50,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.13/159.37 [2019-03-28 12:45:50,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.13/159.37 [2019-03-28 12:45:50,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.13/159.37 [2019-03-28 12:45:50,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.13/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.13/159.37 Number of strict supporting invariants: 0 200.13/159.37 Number of non-strict supporting invariants: 1 200.13/159.37 Consider only non-deceasing supporting invariants: true 200.13/159.37 Simplify termination arguments: true 200.13/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.13/159.37 [2019-03-28 12:45:50,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.13/159.37 [2019-03-28 12:45:50,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.13/159.37 [2019-03-28 12:45:50,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.13/159.37 [2019-03-28 12:45:50,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.13/159.37 [2019-03-28 12:45:50,785 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.13/159.37 [2019-03-28 12:45:50,785 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.13/159.37 [2019-03-28 12:45:50,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.13/159.37 [2019-03-28 12:45:50,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.13/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.13/159.37 Number of strict supporting invariants: 0 200.13/159.37 Number of non-strict supporting invariants: 1 200.13/159.37 Consider only non-deceasing supporting invariants: true 200.13/159.37 Simplify termination arguments: true 200.13/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.13/159.37 [2019-03-28 12:45:50,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.13/159.37 [2019-03-28 12:45:50,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.13/159.37 [2019-03-28 12:45:50,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.13/159.37 [2019-03-28 12:45:50,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.13/159.37 [2019-03-28 12:45:50,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.13/159.37 [2019-03-28 12:45:50,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.13/159.37 [2019-03-28 12:45:50,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.13/159.37 [2019-03-28 12:45:50,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.13/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.13/159.37 Number of strict supporting invariants: 0 200.13/159.37 Number of non-strict supporting invariants: 1 200.13/159.37 Consider only non-deceasing supporting invariants: true 200.13/159.37 Simplify termination arguments: true 200.13/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.13/159.37 [2019-03-28 12:45:50,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.13/159.37 [2019-03-28 12:45:50,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.13/159.37 [2019-03-28 12:45:50,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.13/159.37 [2019-03-28 12:45:50,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.13/159.37 [2019-03-28 12:45:50,815 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.13/159.37 [2019-03-28 12:45:50,815 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.13/159.37 [2019-03-28 12:45:50,825 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 200.13/159.37 [2019-03-28 12:45:50,835 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 200.13/159.37 [2019-03-28 12:45:50,836 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. 200.13/159.37 [2019-03-28 12:45:50,838 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 200.13/159.37 [2019-03-28 12:45:50,840 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 200.13/159.37 [2019-03-28 12:45:50,840 INFO L518 LassoAnalysis]: Proved termination. 200.13/159.37 [2019-03-28 12:45:50,841 INFO L520 LassoAnalysis]: Termination argument consisting of: 200.13/159.37 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 200.13/159.37 Supporting invariants [] 200.13/159.37 [2019-03-28 12:45:50,920 INFO L297 tatePredicateManager]: 22 out of 23 supporting invariants were superfluous and have been removed 200.13/159.37 [2019-03-28 12:45:50,924 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 200.13/159.37 [2019-03-28 12:45:50,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.37 [2019-03-28 12:45:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.13/159.37 [2019-03-28 12:45:50,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core 200.13/159.37 [2019-03-28 12:45:50,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.13/159.37 [2019-03-28 12:45:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.13/159.37 [2019-03-28 12:45:51,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 200.13/159.37 [2019-03-28 12:45:51,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.13/159.37 [2019-03-28 12:45:51,121 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 200.13/159.37 [2019-03-28 12:45:51,122 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.13/159.37 [2019-03-28 12:45:51,131 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.13/159.37 [2019-03-28 12:45:51,132 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.13/159.37 [2019-03-28 12:45:51,132 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 200.13/159.37 [2019-03-28 12:45:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 200.13/159.37 [2019-03-28 12:45:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.13/159.37 [2019-03-28 12:45:51,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 200.13/159.37 [2019-03-28 12:45:51,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.13/159.37 [2019-03-28 12:45:51,323 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 200.13/159.37 [2019-03-28 12:45:51,324 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.13/159.37 [2019-03-28 12:45:51,330 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.13/159.37 [2019-03-28 12:45:51,331 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.13/159.37 [2019-03-28 12:45:51,331 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 200.13/159.37 [2019-03-28 12:45:51,361 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 200.13/159.37 [2019-03-28 12:45:51,362 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.13/159.37 [2019-03-28 12:45:51,370 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.13/159.37 [2019-03-28 12:45:51,370 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.13/159.37 [2019-03-28 12:45:51,371 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 200.13/159.37 [2019-03-28 12:45:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.13/159.37 [2019-03-28 12:45:51,439 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 200.13/159.37 [2019-03-28 12:45:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.13/159.37 [2019-03-28 12:45:51,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 200.13/159.37 [2019-03-28 12:45:51,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.13/159.37 [2019-03-28 12:45:51,455 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 200.13/159.37 [2019-03-28 12:45:51,456 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.13/159.37 [2019-03-28 12:45:51,463 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.13/159.37 [2019-03-28 12:45:51,463 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.13/159.37 [2019-03-28 12:45:51,464 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 200.13/159.37 [2019-03-28 12:45:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.13/159.37 [2019-03-28 12:45:51,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 200.13/159.37 [2019-03-28 12:45:51,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.13/159.37 [2019-03-28 12:45:51,492 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 200.13/159.37 [2019-03-28 12:45:51,493 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.13/159.37 [2019-03-28 12:45:51,502 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.13/159.37 [2019-03-28 12:45:51,503 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.13/159.37 [2019-03-28 12:45:51,503 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 200.13/159.37 [2019-03-28 12:45:51,519 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 200.13/159.37 [2019-03-28 12:45:51,520 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.13/159.37 [2019-03-28 12:45:51,530 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.13/159.37 [2019-03-28 12:45:51,531 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.13/159.37 [2019-03-28 12:45:51,531 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 200.13/159.37 [2019-03-28 12:45:51,532 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization 200.13/159.37 [2019-03-28 12:45:51,536 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 7 loop predicates 200.13/159.37 [2019-03-28 12:45:51,537 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 27 states and 38 transitions. cyclomatic complexity: 12 Second operand 7 states. 200.13/159.37 [2019-03-28 12:45:52,501 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 27 states and 38 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 374 states and 437 transitions. Complement of second has 81 states. 200.13/159.37 [2019-03-28 12:45:52,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 29 states 4 stem states 22 non-accepting loop states 3 accepting loop states 200.13/159.37 [2019-03-28 12:45:52,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 200.13/159.37 [2019-03-28 12:45:52,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 212 transitions. 200.13/159.37 [2019-03-28 12:45:52,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 212 transitions. Stem has 5 letters. Loop has 10 letters. 200.13/159.37 [2019-03-28 12:45:52,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. 200.13/159.37 [2019-03-28 12:45:52,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 212 transitions. Stem has 15 letters. Loop has 10 letters. 200.13/159.37 [2019-03-28 12:45:52,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. 200.13/159.37 [2019-03-28 12:45:52,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 212 transitions. Stem has 5 letters. Loop has 20 letters. 200.13/159.37 [2019-03-28 12:45:52,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. 200.13/159.37 [2019-03-28 12:45:52,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 374 states and 437 transitions. 200.13/159.37 [2019-03-28 12:45:52,540 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 116 200.13/159.37 [2019-03-28 12:45:52,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 374 states to 264 states and 311 transitions. 200.13/159.37 [2019-03-28 12:45:52,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 200.13/159.37 [2019-03-28 12:45:52,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 226 200.13/159.37 [2019-03-28 12:45:52,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 264 states and 311 transitions. 200.13/159.37 [2019-03-28 12:45:52,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 200.13/159.37 [2019-03-28 12:45:52,545 INFO L706 BuchiCegarLoop]: Abstraction has 264 states and 311 transitions. 200.13/159.37 [2019-03-28 12:45:52,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states and 311 transitions. 200.13/159.37 [2019-03-28 12:45:52,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 71. 200.13/159.37 [2019-03-28 12:45:52,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. 200.13/159.37 [2019-03-28 12:45:52,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. 200.13/159.37 [2019-03-28 12:45:52,552 INFO L729 BuchiCegarLoop]: Abstraction has 71 states and 90 transitions. 200.13/159.37 [2019-03-28 12:45:52,552 INFO L609 BuchiCegarLoop]: Abstraction has 71 states and 90 transitions. 200.13/159.37 [2019-03-28 12:45:52,552 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 200.13/159.37 [2019-03-28 12:45:52,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 90 transitions. 200.13/159.37 [2019-03-28 12:45:52,553 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 36 200.13/159.37 [2019-03-28 12:45:52,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 200.13/159.37 [2019-03-28 12:45:52,553 INFO L119 BuchiIsEmpty]: Starting construction of run 200.13/159.37 [2019-03-28 12:45:52,554 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 200.13/159.37 [2019-03-28 12:45:52,554 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 200.13/159.37 [2019-03-28 12:45:52,554 INFO L794 eck$LassoCheckResult]: Stem: 986#ULTIMATE.startENTRY [108] 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] 981#L-1 [187] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 983#L10 [94] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 1007#L10-1 [135] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 1006#L11 [109] L11-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 1004#L13-7 [120] L13-7-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 1005#L13 200.13/159.37 [2019-03-28 12:45:52,555 INFO L796 eck$LassoCheckResult]: Loop: 1005#L13 [208] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (>= 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 1026#L13-1 [142] L13-1-->L13-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_4|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} AuxVars[] AssignedVars[] 1025#L13-3 [138] L13-3-->L13-4: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 1024#L13-4 [218] L13-4-->L13-5: Formula: (and |v_ULTIMATE.start_test_fun_#t~short5_5| (< 0 |v_ULTIMATE.start_test_fun_#t~mem4_3|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 1023#L13-5 [124] L13-5-->L14: Formula: |v_ULTIMATE.start_test_fun_#t~short5_9| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 1022#L14 [101] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{#valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 1021#L14-1 [164] L14-1-->L17: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem6_6|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 1019#L17 [132] L17-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem8_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_23|} OutVars{#valid=|v_#valid_23|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1017#L17-1 [171] L17-1-->L17-3: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem8_6|) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1014#L17-3 [144] L17-3-->L23: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 990#L23 [254] L23-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1))) |v_#memory_int_29|)) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 991#L13-7 [120] L13-7-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 1005#L13 200.13/159.37 [2019-03-28 12:45:52,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.37 [2019-03-28 12:45:52,555 INFO L82 PathProgramCache]: Analyzing trace with hash -139883292, now seen corresponding path program 1 times 200.13/159.37 [2019-03-28 12:45:52,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.13/159.37 [2019-03-28 12:45:52,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.13/159.37 [2019-03-28 12:45:52,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:52,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:52,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.13/159.37 [2019-03-28 12:45:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.13/159.37 [2019-03-28 12:45:52,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.37 [2019-03-28 12:45:52,575 INFO L82 PathProgramCache]: Analyzing trace with hash 115868823, now seen corresponding path program 1 times 200.13/159.37 [2019-03-28 12:45:52,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.13/159.37 [2019-03-28 12:45:52,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.13/159.37 [2019-03-28 12:45:52,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:52,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:52,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.13/159.37 [2019-03-28 12:45:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 200.13/159.37 [2019-03-28 12:45:52,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 200.13/159.37 [2019-03-28 12:45:52,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 200.13/159.37 [2019-03-28 12:45:52,603 INFO L811 eck$LassoCheckResult]: loop already infeasible 200.13/159.37 [2019-03-28 12:45:52,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 200.13/159.37 [2019-03-28 12:45:52,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 200.13/159.37 [2019-03-28 12:45:52,603 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. cyclomatic complexity: 22 Second operand 5 states. 200.13/159.37 [2019-03-28 12:45:52,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 200.13/159.37 [2019-03-28 12:45:52,713 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. 200.13/159.37 [2019-03-28 12:45:52,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 200.13/159.37 [2019-03-28 12:45:52,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 97 transitions. 200.13/159.37 [2019-03-28 12:45:52,722 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 200.13/159.37 [2019-03-28 12:45:52,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 79 states and 95 transitions. 200.13/159.37 [2019-03-28 12:45:52,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 200.13/159.37 [2019-03-28 12:45:52,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 200.13/159.37 [2019-03-28 12:45:52,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 95 transitions. 200.13/159.37 [2019-03-28 12:45:52,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 200.13/159.37 [2019-03-28 12:45:52,724 INFO L706 BuchiCegarLoop]: Abstraction has 79 states and 95 transitions. 200.13/159.37 [2019-03-28 12:45:52,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 95 transitions. 200.13/159.37 [2019-03-28 12:45:52,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. 200.13/159.37 [2019-03-28 12:45:52,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. 200.13/159.37 [2019-03-28 12:45:52,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. 200.13/159.37 [2019-03-28 12:45:52,728 INFO L729 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. 200.13/159.37 [2019-03-28 12:45:52,728 INFO L609 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. 200.13/159.37 [2019-03-28 12:45:52,728 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 200.13/159.37 [2019-03-28 12:45:52,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 83 transitions. 200.13/159.37 [2019-03-28 12:45:52,729 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 34 200.13/159.37 [2019-03-28 12:45:52,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 200.13/159.37 [2019-03-28 12:45:52,729 INFO L119 BuchiIsEmpty]: Starting construction of run 200.13/159.37 [2019-03-28 12:45:52,730 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 200.13/159.37 [2019-03-28 12:45:52,730 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 200.13/159.37 [2019-03-28 12:45:52,731 INFO L794 eck$LassoCheckResult]: Stem: 1147#ULTIMATE.startENTRY [108] 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] 1141#L-1 [187] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 1143#L10 [94] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 1163#L10-1 [135] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 1162#L11 [109] L11-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 1161#L13-7 [120] L13-7-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 1127#L13 200.13/159.37 [2019-03-28 12:45:52,731 INFO L796 eck$LassoCheckResult]: Loop: 1127#L13 [208] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (>= 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 1175#L13-1 [142] L13-1-->L13-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_4|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} AuxVars[] AssignedVars[] 1174#L13-3 [138] L13-3-->L13-4: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 1173#L13-4 [218] L13-4-->L13-5: Formula: (and |v_ULTIMATE.start_test_fun_#t~short5_5| (< 0 |v_ULTIMATE.start_test_fun_#t~mem4_3|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 1172#L13-5 [124] L13-5-->L14: Formula: |v_ULTIMATE.start_test_fun_#t~short5_9| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 1170#L14 [101] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{#valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 1171#L14-1 [97] L14-1-->L15: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem6_4|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_4|} OutVars{ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 1182#L15 [105] L15-->L15-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_17|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_17|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 1181#L15-1 [252] L15-1-->L17-3: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) 1) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_18 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| (- 1)))) |v_#memory_int_25|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~x_ref~0.base_18))) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_37|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_37|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 1180#L17-3 [144] L17-3-->L23: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 1152#L23 [254] L23-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1))) |v_#memory_int_29|)) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 1126#L13-7 [120] L13-7-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 1127#L13 200.13/159.37 [2019-03-28 12:45:52,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.37 [2019-03-28 12:45:52,732 INFO L82 PathProgramCache]: Analyzing trace with hash -139883292, now seen corresponding path program 2 times 200.13/159.37 [2019-03-28 12:45:52,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.13/159.37 [2019-03-28 12:45:52,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.13/159.37 [2019-03-28 12:45:52,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:52,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:52,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.13/159.37 [2019-03-28 12:45:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.13/159.37 [2019-03-28 12:45:52,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.37 [2019-03-28 12:45:52,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1824806290, now seen corresponding path program 1 times 200.13/159.37 [2019-03-28 12:45:52,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.13/159.37 [2019-03-28 12:45:52,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.13/159.37 [2019-03-28 12:45:52,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:52,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:52,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.13/159.37 [2019-03-28 12:45:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.13/159.37 [2019-03-28 12:45:52,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.37 [2019-03-28 12:45:52,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2065824465, now seen corresponding path program 1 times 200.13/159.37 [2019-03-28 12:45:52,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.13/159.37 [2019-03-28 12:45:52,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.13/159.37 [2019-03-28 12:45:52,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:52,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:52,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.13/159.37 [2019-03-28 12:45:52,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 200.13/159.37 [2019-03-28 12:45:52,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 200.13/159.37 [2019-03-28 12:45:52,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 200.13/159.37 [2019-03-28 12:45:52,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 200.13/159.37 [2019-03-28 12:45:52,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 200.13/159.37 [2019-03-28 12:45:52,934 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. cyclomatic complexity: 19 Second operand 5 states. 200.13/159.37 [2019-03-28 12:45:53,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 200.13/159.37 [2019-03-28 12:45:53,027 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. 200.13/159.37 [2019-03-28 12:45:53,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 200.13/159.37 [2019-03-28 12:45:53,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 74 transitions. 200.13/159.37 [2019-03-28 12:45:53,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 200.13/159.37 [2019-03-28 12:45:53,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 55 states and 68 transitions. 200.13/159.37 [2019-03-28 12:45:53,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 200.13/159.37 [2019-03-28 12:45:53,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 200.13/159.37 [2019-03-28 12:45:53,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 68 transitions. 200.13/159.37 [2019-03-28 12:45:53,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 200.13/159.37 [2019-03-28 12:45:53,036 INFO L706 BuchiCegarLoop]: Abstraction has 55 states and 68 transitions. 200.13/159.37 [2019-03-28 12:45:53,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 68 transitions. 200.13/159.37 [2019-03-28 12:45:53,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. 200.13/159.37 [2019-03-28 12:45:53,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. 200.13/159.37 [2019-03-28 12:45:53,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. 200.13/159.37 [2019-03-28 12:45:53,039 INFO L729 BuchiCegarLoop]: Abstraction has 48 states and 61 transitions. 200.13/159.37 [2019-03-28 12:45:53,039 INFO L609 BuchiCegarLoop]: Abstraction has 48 states and 61 transitions. 200.13/159.37 [2019-03-28 12:45:53,039 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 200.13/159.37 [2019-03-28 12:45:53,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 61 transitions. 200.13/159.37 [2019-03-28 12:45:53,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 200.13/159.37 [2019-03-28 12:45:53,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 200.13/159.37 [2019-03-28 12:45:53,040 INFO L119 BuchiIsEmpty]: Starting construction of run 200.13/159.37 [2019-03-28 12:45:53,041 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 200.13/159.37 [2019-03-28 12:45:53,041 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 200.13/159.37 [2019-03-28 12:45:53,041 INFO L794 eck$LassoCheckResult]: Stem: 1288#ULTIMATE.startENTRY [108] 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] 1283#L-1 [186] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 1284#L10 [94] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 1279#L10-1 [135] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 1280#L11 [109] L11-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 1289#L13-7 [120] L13-7-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 1269#L13 [208] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (>= 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 1290#L13-1 200.13/159.37 [2019-03-28 12:45:53,042 INFO L796 eck$LassoCheckResult]: Loop: 1290#L13-1 [142] L13-1-->L13-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_4|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} AuxVars[] AssignedVars[] 1286#L13-3 [138] L13-3-->L13-4: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 1281#L13-4 [218] L13-4-->L13-5: Formula: (and |v_ULTIMATE.start_test_fun_#t~short5_5| (< 0 |v_ULTIMATE.start_test_fun_#t~mem4_3|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 1275#L13-5 [124] L13-5-->L14: Formula: |v_ULTIMATE.start_test_fun_#t~short5_9| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 1276#L14 [101] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{#valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 1295#L14-1 [164] L14-1-->L17: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem6_6|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 1272#L17 [132] L17-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem8_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_23|} OutVars{#valid=|v_#valid_23|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1266#L17-1 [130] L17-1-->L18: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem8_4|) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_4|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1267#L18 [89] L18-->L18-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 1273#L18-1 [253] L18-1-->L17-3: Formula: (and (= 1 (select |v_#valid_48| v_ULTIMATE.start_test_fun_~y_ref~0.base_18)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_13) (= |v_#memory_int_27| (store |v_#memory_int_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_18 (store (select |v_#memory_int_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_18) v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~y_ref~0.base_18))) InVars {#valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13} OutVars{#valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 1274#L17-3 [144] L17-3-->L23: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 1292#L23 [254] L23-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1))) |v_#memory_int_29|)) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 1293#L13-7 [120] L13-7-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 1309#L13 [208] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (>= 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 1290#L13-1 200.13/159.37 [2019-03-28 12:45:53,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.37 [2019-03-28 12:45:53,042 INFO L82 PathProgramCache]: Analyzing trace with hash -70043699, now seen corresponding path program 1 times 200.13/159.37 [2019-03-28 12:45:53,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.13/159.37 [2019-03-28 12:45:53,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.13/159.37 [2019-03-28 12:45:53,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:53,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:53,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.13/159.37 [2019-03-28 12:45:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.13/159.37 [2019-03-28 12:45:53,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.37 [2019-03-28 12:45:53,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1366813254, now seen corresponding path program 1 times 200.13/159.37 [2019-03-28 12:45:53,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.13/159.37 [2019-03-28 12:45:53,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.13/159.37 [2019-03-28 12:45:53,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:53,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:53,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.13/159.37 [2019-03-28 12:45:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.13/159.37 [2019-03-28 12:45:53,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.13/159.37 [2019-03-28 12:45:53,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1589087506, now seen corresponding path program 1 times 200.13/159.37 [2019-03-28 12:45:53,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.13/159.37 [2019-03-28 12:45:53,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.13/159.37 [2019-03-28 12:45:53,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:53,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:53,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.13/159.37 [2019-03-28 12:45:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.13/159.37 [2019-03-28 12:45:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.13/159.37 [2019-03-28 12:45:53,281 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 200.13/159.37 [2019-03-28 12:45:53,735 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 200.13/159.37 [2019-03-28 12:45:53,905 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 87 200.13/159.37 [2019-03-28 12:45:53,908 INFO L216 LassoAnalysis]: Preferences: 200.13/159.37 [2019-03-28 12:45:53,908 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 200.13/159.37 [2019-03-28 12:45:53,909 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 200.13/159.37 [2019-03-28 12:45:53,909 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 200.13/159.37 [2019-03-28 12:45:53,909 INFO L127 ssoRankerPreferences]: Use exernal solver: false 200.13/159.37 [2019-03-28 12:45:53,909 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 200.13/159.37 [2019-03-28 12:45:53,909 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 200.13/159.37 [2019-03-28 12:45:53,909 INFO L130 ssoRankerPreferences]: Path of dumped script: 200.13/159.37 [2019-03-28 12:45:53,909 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso 200.13/159.37 [2019-03-28 12:45:53,909 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 200.13/159.37 [2019-03-28 12:45:53,909 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 200.13/159.37 [2019-03-28 12:45:53,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:53,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:53,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:53,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:53,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:53,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:53,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:53,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:53,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:53,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:53,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:53,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:53,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:53,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.13/159.37 [2019-03-28 12:45:54,243 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 200.13/159.37 [2019-03-28 12:45:54,354 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 200.13/159.37 [2019-03-28 12:45:54,744 INFO L300 LassoAnalysis]: Preprocessing complete. 200.13/159.37 [2019-03-28 12:45:54,745 INFO L497 LassoAnalysis]: Using template 'affine'. 200.13/159.37 [2019-03-28 12:45:54,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.13/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.13/159.37 Number of strict supporting invariants: 0 200.13/159.37 Number of non-strict supporting invariants: 1 200.13/159.37 Consider only non-deceasing supporting invariants: true 200.13/159.37 Simplify termination arguments: true 200.13/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.13/159.37 [2019-03-28 12:45:54,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.13/159.37 [2019-03-28 12:45:54,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 200.13/159.37 [2019-03-28 12:45:54,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.13/159.37 [2019-03-28 12:45:54,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.13/159.37 [2019-03-28 12:45:54,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.13/159.37 [2019-03-28 12:45:54,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 200.13/159.37 [2019-03-28 12:45:54,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 200.13/159.37 [2019-03-28 12:45:54,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.13/159.37 [2019-03-28 12:45:54,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.13/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.13/159.37 Number of strict supporting invariants: 0 200.13/159.37 Number of non-strict supporting invariants: 1 200.13/159.37 Consider only non-deceasing supporting invariants: true 200.13/159.37 Simplify termination arguments: true 200.13/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.13/159.37 [2019-03-28 12:45:54,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.13/159.37 [2019-03-28 12:45:54,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 200.20/159.37 [2019-03-28 12:45:54,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:54,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:54,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:54,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:54,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:54,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:54,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:54,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:54,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 200.20/159.37 [2019-03-28 12:45:54,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:54,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:54,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:54,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:54,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:54,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:54,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:54,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:54,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 200.20/159.37 [2019-03-28 12:45:54,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:54,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:54,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:54,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:54,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:54,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:54,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:54,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:54,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:54,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:54,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:54,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:54,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:54,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:54,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:54,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:54,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 200.20/159.37 [2019-03-28 12:45:54,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:54,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:54,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:54,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:54,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:54,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:54,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:54,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:54,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 200.20/159.37 [2019-03-28 12:45:54,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:54,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:54,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:54,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:54,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:54,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:54,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:54,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:54,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:54,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:54,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:54,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:54,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:54,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:54,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:54,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:54,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 200.20/159.37 [2019-03-28 12:45:54,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:54,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:54,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:54,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:54,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:54,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:54,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:54,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:54,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 200.20/159.37 [2019-03-28 12:45:54,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:54,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:54,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:54,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:54,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:54,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:54,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:54,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:54,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 200.20/159.37 [2019-03-28 12:45:54,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:54,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:54,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:54,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:54,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:54,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:54,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:54,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:54,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:54,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:54,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:54,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:54,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:54,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:54,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:54,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:54,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 200.20/159.37 [2019-03-28 12:45:54,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:54,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:54,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:54,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:54,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:54,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:54,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:54,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:54,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:54,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:54,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:54,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:54,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:54,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:54,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:54,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:54,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:54,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:54,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:54,805 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:54,805 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:54,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:54,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:54,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:54,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:54,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:54,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:54,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:54,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:54,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:54,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:54,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:54,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:54,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:54,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:54,814 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:54,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:54,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:54,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:54,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:54,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:54,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:54,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:54,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:54,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:54,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:54,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:54,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:54,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:54,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:54,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:54,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:54,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:54,835 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 200.20/159.37 [2019-03-28 12:45:54,841 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 200.20/159.37 [2019-03-28 12:45:54,841 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. 200.20/159.37 [2019-03-28 12:45:54,841 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 200.20/159.37 [2019-03-28 12:45:54,842 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 200.20/159.37 [2019-03-28 12:45:54,843 INFO L518 LassoAnalysis]: Proved termination. 200.20/159.37 [2019-03-28 12:45:54,843 INFO L520 LassoAnalysis]: Termination argument consisting of: 200.20/159.37 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 200.20/159.37 Supporting invariants [] 200.20/159.37 [2019-03-28 12:45:54,924 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 200.20/159.37 [2019-03-28 12:45:54,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 200.20/159.37 [2019-03-28 12:45:54,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.20/159.37 [2019-03-28 12:45:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.37 [2019-03-28 12:45:54,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core 200.20/159.37 [2019-03-28 12:45:54,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.37 [2019-03-28 12:45:54,971 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 200.20/159.37 [2019-03-28 12:45:54,971 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:54,977 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:45:54,977 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:54,978 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 200.20/159.37 [2019-03-28 12:45:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.37 [2019-03-28 12:45:54,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core 200.20/159.37 [2019-03-28 12:45:54,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.37 [2019-03-28 12:45:55,048 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 200.20/159.37 [2019-03-28 12:45:55,050 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,057 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:45:55,057 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,058 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 200.20/159.37 [2019-03-28 12:45:55,103 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 200.20/159.37 [2019-03-28 12:45:55,103 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,112 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:45:55,113 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,113 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 200.20/159.37 [2019-03-28 12:45:55,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 200.20/159.37 [2019-03-28 12:45:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.37 [2019-03-28 12:45:55,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core 200.20/159.37 [2019-03-28 12:45:55,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.37 [2019-03-28 12:45:55,218 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 200.20/159.37 [2019-03-28 12:45:55,219 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,226 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:45:55,226 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,227 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 200.20/159.37 [2019-03-28 12:45:55,232 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 200.20/159.37 [2019-03-28 12:45:55,233 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,240 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:45:55,241 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,241 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 200.20/159.37 [2019-03-28 12:45:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.37 [2019-03-28 12:45:55,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core 200.20/159.37 [2019-03-28 12:45:55,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.37 [2019-03-28 12:45:55,279 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 200.20/159.37 [2019-03-28 12:45:55,280 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,287 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:45:55,287 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,288 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 200.20/159.37 [2019-03-28 12:45:55,293 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 200.20/159.37 [2019-03-28 12:45:55,294 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,301 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:45:55,302 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,302 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 200.20/159.37 [2019-03-28 12:45:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.37 [2019-03-28 12:45:55,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core 200.20/159.37 [2019-03-28 12:45:55,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.37 [2019-03-28 12:45:55,344 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 200.20/159.37 [2019-03-28 12:45:55,345 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,351 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:45:55,352 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,352 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 200.20/159.37 [2019-03-28 12:45:55,377 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 200.20/159.37 [2019-03-28 12:45:55,378 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,384 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:45:55,385 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,385 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 200.20/159.37 [2019-03-28 12:45:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.20/159.37 [2019-03-28 12:45:55,440 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 200.20/159.37 [2019-03-28 12:45:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.37 [2019-03-28 12:45:55,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core 200.20/159.37 [2019-03-28 12:45:55,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.37 [2019-03-28 12:45:55,456 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 200.20/159.37 [2019-03-28 12:45:55,456 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,462 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:45:55,462 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,463 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 200.20/159.37 [2019-03-28 12:45:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.37 [2019-03-28 12:45:55,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core 200.20/159.37 [2019-03-28 12:45:55,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.37 [2019-03-28 12:45:55,486 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 200.20/159.37 [2019-03-28 12:45:55,487 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,493 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:45:55,494 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,494 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 200.20/159.37 [2019-03-28 12:45:55,506 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 200.20/159.37 [2019-03-28 12:45:55,507 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,515 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:45:55,515 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,515 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 200.20/159.37 [2019-03-28 12:45:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.37 [2019-03-28 12:45:55,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core 200.20/159.37 [2019-03-28 12:45:55,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.37 [2019-03-28 12:45:55,534 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 200.20/159.37 [2019-03-28 12:45:55,535 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,542 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:45:55,542 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,543 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 200.20/159.37 [2019-03-28 12:45:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.37 [2019-03-28 12:45:55,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core 200.20/159.37 [2019-03-28 12:45:55,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.37 [2019-03-28 12:45:55,561 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 200.20/159.37 [2019-03-28 12:45:55,561 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,568 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:45:55,569 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,569 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 200.20/159.37 [2019-03-28 12:45:55,573 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 200.20/159.37 [2019-03-28 12:45:55,574 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,581 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:45:55,581 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:55,582 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 200.20/159.37 [2019-03-28 12:45:55,583 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 8 predicates after loop cannibalization 200.20/159.37 [2019-03-28 12:45:55,583 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates 200.20/159.37 [2019-03-28 12:45:55,583 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 48 states and 61 transitions. cyclomatic complexity: 15 Second operand 8 states. 200.20/159.37 [2019-03-28 12:45:56,177 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 48 states and 61 transitions. cyclomatic complexity: 15. Second operand 8 states. Result 731 states and 798 transitions. Complement of second has 188 states. 200.20/159.37 [2019-03-28 12:45:56,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 2 stem states 18 non-accepting loop states 1 accepting loop states 200.20/159.37 [2019-03-28 12:45:56,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 200.20/159.37 [2019-03-28 12:45:56,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 105 transitions. 200.20/159.37 [2019-03-28 12:45:56,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 105 transitions. Stem has 7 letters. Loop has 14 letters. 200.20/159.37 [2019-03-28 12:45:56,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. 200.20/159.37 [2019-03-28 12:45:56,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 105 transitions. Stem has 21 letters. Loop has 14 letters. 200.20/159.37 [2019-03-28 12:45:56,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. 200.20/159.37 [2019-03-28 12:45:56,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 105 transitions. Stem has 7 letters. Loop has 28 letters. 200.20/159.37 [2019-03-28 12:45:56,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. 200.20/159.37 [2019-03-28 12:45:56,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 731 states and 798 transitions. 200.20/159.37 [2019-03-28 12:45:56,194 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 144 200.20/159.37 [2019-03-28 12:45:56,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 731 states to 213 states and 240 transitions. 200.20/159.37 [2019-03-28 12:45:56,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 200.20/159.37 [2019-03-28 12:45:56,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 200.20/159.37 [2019-03-28 12:45:56,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 213 states and 240 transitions. 200.20/159.37 [2019-03-28 12:45:56,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 200.20/159.37 [2019-03-28 12:45:56,197 INFO L706 BuchiCegarLoop]: Abstraction has 213 states and 240 transitions. 200.20/159.37 [2019-03-28 12:45:56,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states and 240 transitions. 200.20/159.37 [2019-03-28 12:45:56,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 55. 200.20/159.37 [2019-03-28 12:45:56,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. 200.20/159.37 [2019-03-28 12:45:56,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. 200.20/159.37 [2019-03-28 12:45:56,201 INFO L729 BuchiCegarLoop]: Abstraction has 55 states and 69 transitions. 200.20/159.37 [2019-03-28 12:45:56,201 INFO L609 BuchiCegarLoop]: Abstraction has 55 states and 69 transitions. 200.20/159.37 [2019-03-28 12:45:56,201 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 200.20/159.37 [2019-03-28 12:45:56,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 69 transitions. 200.20/159.37 [2019-03-28 12:45:56,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 200.20/159.37 [2019-03-28 12:45:56,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 200.20/159.37 [2019-03-28 12:45:56,202 INFO L119 BuchiIsEmpty]: Starting construction of run 200.20/159.37 [2019-03-28 12:45:56,202 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 200.20/159.37 [2019-03-28 12:45:56,202 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 200.20/159.37 [2019-03-28 12:45:56,203 INFO L794 eck$LassoCheckResult]: Stem: 2755#ULTIMATE.startENTRY [108] 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] 2749#L-1 [186] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 2750#L10 [94] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 2754#L10-1 [135] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 2756#L11 [109] L11-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 2757#L13-7 [120] L13-7-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 2762#L13 200.20/159.37 [2019-03-28 12:45:56,204 INFO L796 eck$LassoCheckResult]: Loop: 2762#L13 [209] L13-->L13-1: Formula: (and (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short5_2|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 2758#L13-1 [141] L13-1-->L13-5: Formula: |v_ULTIMATE.start_test_fun_#t~short5_3| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} AuxVars[] AssignedVars[] 2741#L13-5 [124] L13-5-->L14: Formula: |v_ULTIMATE.start_test_fun_#t~short5_9| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 2742#L14 [101] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{#valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 2763#L14-1 [97] L14-1-->L15: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem6_4|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_4|} OutVars{ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 2728#L15 [105] L15-->L15-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_17|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_17|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 2729#L15-1 [252] L15-1-->L17-3: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) 1) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_18 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| (- 1)))) |v_#memory_int_25|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~x_ref~0.base_18))) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_37|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_37|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 2765#L17-3 [144] L17-3-->L23: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 2760#L23 [254] L23-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1))) |v_#memory_int_29|)) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 2734#L13-7 [120] L13-7-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 2735#L13 [208] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (>= 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 2780#L13-1 [142] L13-1-->L13-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_4|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} AuxVars[] AssignedVars[] 2753#L13-3 [138] L13-3-->L13-4: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 2746#L13-4 [218] L13-4-->L13-5: Formula: (and |v_ULTIMATE.start_test_fun_#t~short5_5| (< 0 |v_ULTIMATE.start_test_fun_#t~mem4_3|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 2743#L13-5 [124] L13-5-->L14: Formula: |v_ULTIMATE.start_test_fun_#t~short5_9| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 2744#L14 [101] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{#valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 2764#L14-1 [164] L14-1-->L17: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem6_6|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 2738#L17 [132] L17-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem8_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_23|} OutVars{#valid=|v_#valid_23|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 2732#L17-1 [130] L17-1-->L18: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem8_4|) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_4|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 2733#L18 [89] L18-->L18-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 2739#L18-1 [253] L18-1-->L17-3: Formula: (and (= 1 (select |v_#valid_48| v_ULTIMATE.start_test_fun_~y_ref~0.base_18)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_13) (= |v_#memory_int_27| (store |v_#memory_int_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_18 (store (select |v_#memory_int_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_18) v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~y_ref~0.base_18))) InVars {#valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13} OutVars{#valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 2740#L17-3 [144] L17-3-->L23: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 2767#L23 [254] L23-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1))) |v_#memory_int_29|)) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 2781#L13-7 [120] L13-7-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 2762#L13 200.20/159.37 [2019-03-28 12:45:56,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.20/159.37 [2019-03-28 12:45:56,204 INFO L82 PathProgramCache]: Analyzing trace with hash -140806813, now seen corresponding path program 1 times 200.20/159.37 [2019-03-28 12:45:56,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.20/159.37 [2019-03-28 12:45:56,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.20/159.37 [2019-03-28 12:45:56,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.20/159.37 [2019-03-28 12:45:56,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.20/159.37 [2019-03-28 12:45:56,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.20/159.37 [2019-03-28 12:45:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.20/159.37 [2019-03-28 12:45:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.20/159.37 [2019-03-28 12:45:56,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.20/159.37 [2019-03-28 12:45:56,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1979084055, now seen corresponding path program 1 times 200.20/159.37 [2019-03-28 12:45:56,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.20/159.37 [2019-03-28 12:45:56,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.20/159.37 [2019-03-28 12:45:56,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.20/159.37 [2019-03-28 12:45:56,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.20/159.37 [2019-03-28 12:45:56,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.20/159.37 [2019-03-28 12:45:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.20/159.37 [2019-03-28 12:45:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.20/159.37 [2019-03-28 12:45:56,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.20/159.37 [2019-03-28 12:45:56,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1170187143, now seen corresponding path program 1 times 200.20/159.37 [2019-03-28 12:45:56,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.20/159.37 [2019-03-28 12:45:56,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.20/159.37 [2019-03-28 12:45:56,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.20/159.37 [2019-03-28 12:45:56,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.20/159.37 [2019-03-28 12:45:56,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.20/159.37 [2019-03-28 12:45:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.20/159.37 [2019-03-28 12:45:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.20/159.37 [2019-03-28 12:45:56,602 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 200.20/159.37 [2019-03-28 12:45:57,004 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 200.20/159.37 [2019-03-28 12:45:57,160 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 87 200.20/159.37 [2019-03-28 12:45:57,164 INFO L216 LassoAnalysis]: Preferences: 200.20/159.37 [2019-03-28 12:45:57,164 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 200.20/159.37 [2019-03-28 12:45:57,164 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 200.20/159.37 [2019-03-28 12:45:57,164 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 200.20/159.37 [2019-03-28 12:45:57,164 INFO L127 ssoRankerPreferences]: Use exernal solver: false 200.20/159.37 [2019-03-28 12:45:57,165 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 200.20/159.37 [2019-03-28 12:45:57,165 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 200.20/159.37 [2019-03-28 12:45:57,165 INFO L130 ssoRankerPreferences]: Path of dumped script: 200.20/159.37 [2019-03-28 12:45:57,165 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso 200.20/159.37 [2019-03-28 12:45:57,165 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 200.20/159.37 [2019-03-28 12:45:57,165 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 200.20/159.37 [2019-03-28 12:45:57,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.37 [2019-03-28 12:45:57,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.37 [2019-03-28 12:45:57,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.37 [2019-03-28 12:45:57,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.37 [2019-03-28 12:45:57,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.37 [2019-03-28 12:45:57,485 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 200.20/159.37 [2019-03-28 12:45:57,610 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 200.20/159.37 [2019-03-28 12:45:57,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.37 [2019-03-28 12:45:57,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.37 [2019-03-28 12:45:57,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.37 [2019-03-28 12:45:57,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.37 [2019-03-28 12:45:57,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.37 [2019-03-28 12:45:57,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.37 [2019-03-28 12:45:57,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.37 [2019-03-28 12:45:57,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.37 [2019-03-28 12:45:57,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.37 [2019-03-28 12:45:57,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.37 [2019-03-28 12:45:58,037 INFO L300 LassoAnalysis]: Preprocessing complete. 200.20/159.37 [2019-03-28 12:45:58,038 INFO L497 LassoAnalysis]: Using template 'affine'. 200.20/159.37 [2019-03-28 12:45:58,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:58,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:58,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:58,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:58,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:58,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:58,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:58,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:58,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:58,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:58,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 200.20/159.37 [2019-03-28 12:45:58,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:58,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:58,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:58,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:58,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:58,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:58,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:58,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:58,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 200.20/159.37 [2019-03-28 12:45:58,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:58,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:58,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:58,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:58,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:58,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:58,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:58,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:58,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 200.20/159.37 [2019-03-28 12:45:58,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:58,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:58,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:58,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:58,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:58,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:58,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:58,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:58,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:58,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:58,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:58,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:58,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:58,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:58,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:58,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:58,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:58,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:58,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:58,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:58,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:58,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:58,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:58,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:58,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:58,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:58,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:58,071 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:58,071 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:58,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:58,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:58,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:58,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:58,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:58,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:58,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:58,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:58,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:58,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:58,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:58,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:58,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:58,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:58,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:58,082 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:58,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:58,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:58,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:58,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:58,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:58,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:58,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:58,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:58,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:58,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:58,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:58,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:58,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:58,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:58,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:58,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:58,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.37 [2019-03-28 12:45:58,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.37 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.37 Number of strict supporting invariants: 0 200.20/159.37 Number of non-strict supporting invariants: 1 200.20/159.37 Consider only non-deceasing supporting invariants: true 200.20/159.37 Simplify termination arguments: true 200.20/159.37 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.37 [2019-03-28 12:45:58,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.37 [2019-03-28 12:45:58,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.37 [2019-03-28 12:45:58,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.37 [2019-03-28 12:45:58,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.37 [2019-03-28 12:45:58,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.37 [2019-03-28 12:45:58,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.37 [2019-03-28 12:45:58,104 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 200.20/159.37 [2019-03-28 12:45:58,107 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 200.20/159.37 [2019-03-28 12:45:58,108 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. 200.20/159.37 [2019-03-28 12:45:58,108 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 200.20/159.37 [2019-03-28 12:45:58,109 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 200.20/159.37 [2019-03-28 12:45:58,109 INFO L518 LassoAnalysis]: Proved termination. 200.20/159.37 [2019-03-28 12:45:58,109 INFO L520 LassoAnalysis]: Termination argument consisting of: 200.20/159.37 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3 200.20/159.37 Supporting invariants [] 200.20/159.37 [2019-03-28 12:45:58,203 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 200.20/159.37 [2019-03-28 12:45:58,206 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 200.20/159.37 [2019-03-28 12:45:58,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.20/159.37 [2019-03-28 12:45:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.37 [2019-03-28 12:45:58,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core 200.20/159.37 [2019-03-28 12:45:58,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.37 [2019-03-28 12:45:58,249 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 200.20/159.37 [2019-03-28 12:45:58,249 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:58,255 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:45:58,255 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:58,255 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 200.20/159.37 [2019-03-28 12:45:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.37 [2019-03-28 12:45:58,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core 200.20/159.37 [2019-03-28 12:45:58,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.37 [2019-03-28 12:45:58,330 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:45:58,330 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 61 200.20/159.37 [2019-03-28 12:45:58,337 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:58,383 INFO L497 ElimStorePlain]: treesize reduction 41, result has 50.0 percent of original size 200.20/159.37 [2019-03-28 12:45:58,384 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:58,384 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:32 200.20/159.37 [2019-03-28 12:45:58,433 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 200.20/159.37 [2019-03-28 12:45:58,433 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:58,440 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 200.20/159.37 [2019-03-28 12:45:58,441 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:58,445 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 200.20/159.37 [2019-03-28 12:45:58,445 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:58,472 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:45:58,473 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 200.20/159.37 [2019-03-28 12:45:58,473 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:86, output treesize:47 200.20/159.37 [2019-03-28 12:45:58,923 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:45:58,923 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 50 treesize of output 37 200.20/159.37 [2019-03-28 12:45:58,924 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:58,929 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 37 200.20/159.37 [2019-03-28 12:45:58,930 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:58,956 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:45:58,957 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. 200.20/159.37 [2019-03-28 12:45:58,958 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:101, output treesize:57 200.20/159.37 [2019-03-28 12:45:59,045 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:45:59,046 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 41 treesize of output 69 200.20/159.37 [2019-03-28 12:45:59,047 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:59,069 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:45:59,070 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 41 treesize of output 69 200.20/159.37 [2019-03-28 12:45:59,071 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:59,154 INFO L497 ElimStorePlain]: treesize reduction 36, result has 71.7 percent of original size 200.20/159.37 [2019-03-28 12:45:59,156 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 200.20/159.37 [2019-03-28 12:45:59,157 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:83, output treesize:52 200.20/159.37 [2019-03-28 12:45:59,196 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 200.20/159.37 [2019-03-28 12:45:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.37 [2019-03-28 12:45:59,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjunts are in the unsatisfiable core 200.20/159.37 [2019-03-28 12:45:59,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.37 [2019-03-28 12:45:59,831 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:45:59,831 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 61 200.20/159.37 [2019-03-28 12:45:59,835 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:59,886 INFO L497 ElimStorePlain]: treesize reduction 35, result has 53.9 percent of original size 200.20/159.37 [2019-03-28 12:45:59,887 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 200.20/159.37 [2019-03-28 12:45:59,887 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:31 200.20/159.37 [2019-03-28 12:46:12,242 WARN L188 SmtUtils]: Spent 2.85 s on a formula simplification that was a NOOP. DAG size: 23 200.20/159.37 [2019-03-28 12:46:12,253 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 200.20/159.37 [2019-03-28 12:46:12,254 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:12,260 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:12,261 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:12,261 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 200.20/159.37 [2019-03-28 12:46:16,711 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 200.20/159.37 [2019-03-28 12:46:16,711 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:16,720 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:16,720 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:16,720 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 200.20/159.37 [2019-03-28 12:46:16,726 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 200.20/159.37 [2019-03-28 12:46:16,726 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:16,734 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:16,735 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:16,735 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 200.20/159.37 [2019-03-28 12:46:18,200 WARN L860 $PredicateComparison]: unable to prove that (or (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 1) c_oldRank0) (exists ((ULTIMATE.start_test_fun_~x_ref~0.base Int) (ULTIMATE.start_test_fun_~x_ref~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~y_ref~0.base))))) is different from true 200.20/159.37 [2019-03-28 12:46:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.37 [2019-03-28 12:46:18,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core 200.20/159.37 [2019-03-28 12:46:18,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.37 [2019-03-28 12:46:18,308 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:18,308 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 1 case distinctions, treesize of input 21 treesize of output 46 200.20/159.37 [2019-03-28 12:46:18,310 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:18,335 INFO L497 ElimStorePlain]: treesize reduction 18, result has 61.7 percent of original size 200.20/159.37 [2019-03-28 12:46:18,336 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:18,336 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:20 200.20/159.37 [2019-03-28 12:46:18,390 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 25 treesize of output 24 200.20/159.37 [2019-03-28 12:46:18,390 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:18,395 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 200.20/159.37 [2019-03-28 12:46:18,395 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:18,411 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:18,412 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 200.20/159.37 [2019-03-28 12:46:18,412 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:24 200.20/159.37 [2019-03-28 12:46:18,706 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:18,707 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 67 200.20/159.37 [2019-03-28 12:46:18,712 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:18,747 INFO L497 ElimStorePlain]: treesize reduction 56, result has 39.1 percent of original size 200.20/159.37 [2019-03-28 12:46:18,748 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:18,748 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:32 200.20/159.37 [2019-03-28 12:46:18,867 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:18,868 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 41 treesize of output 69 200.20/159.37 [2019-03-28 12:46:18,869 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:18,893 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:18,893 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 41 treesize of output 69 200.20/159.37 [2019-03-28 12:46:18,894 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:18,972 INFO L497 ElimStorePlain]: treesize reduction 36, result has 71.7 percent of original size 200.20/159.37 [2019-03-28 12:46:18,973 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 200.20/159.37 [2019-03-28 12:46:18,973 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:65 200.20/159.37 [2019-03-28 12:46:19,253 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 200.20/159.37 [2019-03-28 12:46:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.37 [2019-03-28 12:46:19,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjunts are in the unsatisfiable core 200.20/159.37 [2019-03-28 12:46:19,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.37 [2019-03-28 12:46:19,743 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 200.20/159.37 [2019-03-28 12:46:19,743 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:19,751 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:19,751 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:19,752 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 200.20/159.37 [2019-03-28 12:46:24,293 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:24,294 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 67 200.20/159.37 [2019-03-28 12:46:24,299 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:24,345 INFO L497 ElimStorePlain]: treesize reduction 63, result has 37.0 percent of original size 200.20/159.37 [2019-03-28 12:46:24,345 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:24,346 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:32 200.20/159.37 [2019-03-28 12:46:24,420 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:24,421 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 41 treesize of output 69 200.20/159.37 [2019-03-28 12:46:24,422 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:24,447 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:24,447 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 41 treesize of output 69 200.20/159.37 [2019-03-28 12:46:24,448 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:24,550 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 200.20/159.37 [2019-03-28 12:46:24,550 INFO L497 ElimStorePlain]: treesize reduction 36, result has 71.7 percent of original size 200.20/159.37 [2019-03-28 12:46:24,551 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 200.20/159.37 [2019-03-28 12:46:24,551 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:65 200.20/159.37 [2019-03-28 12:46:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.37 [2019-03-28 12:46:24,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core 200.20/159.37 [2019-03-28 12:46:24,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.37 [2019-03-28 12:46:24,580 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 200.20/159.37 [2019-03-28 12:46:24,581 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:24,587 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:24,587 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:24,588 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 200.20/159.37 [2019-03-28 12:46:24,617 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:24,618 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 67 200.20/159.37 [2019-03-28 12:46:24,622 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:24,670 INFO L497 ElimStorePlain]: treesize reduction 63, result has 37.0 percent of original size 200.20/159.37 [2019-03-28 12:46:24,671 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:24,671 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:32 200.20/159.37 [2019-03-28 12:46:24,745 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:24,746 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 41 treesize of output 69 200.20/159.37 [2019-03-28 12:46:24,747 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:24,770 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:24,771 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 41 treesize of output 69 200.20/159.37 [2019-03-28 12:46:24,772 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:24,853 INFO L497 ElimStorePlain]: treesize reduction 36, result has 71.7 percent of original size 200.20/159.37 [2019-03-28 12:46:24,854 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 200.20/159.37 [2019-03-28 12:46:24,854 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:65 200.20/159.37 [2019-03-28 12:46:25,016 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 30 treesize of output 25 200.20/159.37 [2019-03-28 12:46:25,016 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:25,024 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:25,024 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:25,025 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:17 200.20/159.37 [2019-03-28 12:46:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.37 [2019-03-28 12:46:25,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjunts are in the unsatisfiable core 200.20/159.37 [2019-03-28 12:46:25,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.37 [2019-03-28 12:46:25,147 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:25,147 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 67 200.20/159.37 [2019-03-28 12:46:25,151 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:25,192 INFO L497 ElimStorePlain]: treesize reduction 63, result has 37.0 percent of original size 200.20/159.37 [2019-03-28 12:46:25,193 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:25,193 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:32 200.20/159.37 [2019-03-28 12:46:25,261 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:25,261 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 41 treesize of output 69 200.20/159.37 [2019-03-28 12:46:25,262 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:25,284 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:25,285 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 41 treesize of output 69 200.20/159.37 [2019-03-28 12:46:25,286 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:25,356 INFO L497 ElimStorePlain]: treesize reduction 36, result has 71.7 percent of original size 200.20/159.37 [2019-03-28 12:46:25,357 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 200.20/159.37 [2019-03-28 12:46:25,357 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:73 200.20/159.37 [2019-03-28 12:46:25,459 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 200.20/159.37 [2019-03-28 12:46:25,460 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:25,470 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 200.20/159.37 [2019-03-28 12:46:25,470 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:25,479 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 30 treesize of output 29 200.20/159.37 [2019-03-28 12:46:25,479 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:25,487 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:25,487 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 41 treesize of output 36 200.20/159.37 [2019-03-28 12:46:25,488 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:25,552 INFO L497 ElimStorePlain]: treesize reduction 30, result has 74.4 percent of original size 200.20/159.37 [2019-03-28 12:46:25,553 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:25,553 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:147, output treesize:17 200.20/159.37 [2019-03-28 12:46:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.37 [2019-03-28 12:46:25,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjunts are in the unsatisfiable core 200.20/159.37 [2019-03-28 12:46:25,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.37 [2019-03-28 12:46:27,161 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:27,161 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 67 200.20/159.37 [2019-03-28 12:46:27,164 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:27,207 INFO L497 ElimStorePlain]: treesize reduction 56, result has 39.1 percent of original size 200.20/159.37 [2019-03-28 12:46:27,208 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:27,208 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:32 200.20/159.37 [2019-03-28 12:46:27,299 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:27,299 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 41 treesize of output 69 200.20/159.37 [2019-03-28 12:46:27,300 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:27,326 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:27,326 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 41 treesize of output 69 200.20/159.37 [2019-03-28 12:46:27,327 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:27,412 INFO L497 ElimStorePlain]: treesize reduction 36, result has 71.7 percent of original size 200.20/159.37 [2019-03-28 12:46:27,413 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 200.20/159.37 [2019-03-28 12:46:27,413 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:73 200.20/159.37 [2019-03-28 12:46:27,433 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 200.20/159.37 [2019-03-28 12:46:27,433 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:27,450 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:27,450 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 41 treesize of output 36 200.20/159.37 [2019-03-28 12:46:27,451 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:27,464 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 200.20/159.37 [2019-03-28 12:46:27,464 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:27,472 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 30 treesize of output 29 200.20/159.37 [2019-03-28 12:46:27,473 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:27,545 INFO L497 ElimStorePlain]: treesize reduction 30, result has 74.4 percent of original size 200.20/159.37 [2019-03-28 12:46:27,546 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:27,546 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:147, output treesize:17 200.20/159.37 [2019-03-28 12:46:27,551 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 200.20/159.37 [2019-03-28 12:46:27,551 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:27,559 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:27,560 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:27,560 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 200.20/159.37 [2019-03-28 12:46:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.37 [2019-03-28 12:46:27,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjunts are in the unsatisfiable core 200.20/159.37 [2019-03-28 12:46:27,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.37 [2019-03-28 12:46:30,724 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:30,724 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 67 200.20/159.37 [2019-03-28 12:46:30,728 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:30,781 INFO L497 ElimStorePlain]: treesize reduction 63, result has 37.0 percent of original size 200.20/159.37 [2019-03-28 12:46:30,781 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:30,782 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:32 200.20/159.37 [2019-03-28 12:46:30,859 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:30,859 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 41 treesize of output 69 200.20/159.37 [2019-03-28 12:46:30,860 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:30,884 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:30,885 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 41 treesize of output 69 200.20/159.37 [2019-03-28 12:46:30,886 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:30,967 INFO L497 ElimStorePlain]: treesize reduction 36, result has 71.7 percent of original size 200.20/159.37 [2019-03-28 12:46:30,967 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 200.20/159.37 [2019-03-28 12:46:30,968 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:73 200.20/159.37 [2019-03-28 12:46:30,988 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 200.20/159.37 [2019-03-28 12:46:30,989 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:31,002 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:31,003 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 41 treesize of output 36 200.20/159.37 [2019-03-28 12:46:31,003 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:31,012 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 200.20/159.37 [2019-03-28 12:46:31,013 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:31,020 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 30 treesize of output 29 200.20/159.37 [2019-03-28 12:46:31,020 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:31,086 INFO L497 ElimStorePlain]: treesize reduction 30, result has 74.4 percent of original size 200.20/159.37 [2019-03-28 12:46:31,087 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:31,087 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:147, output treesize:17 200.20/159.37 [2019-03-28 12:46:31,091 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 200.20/159.37 [2019-03-28 12:46:31,092 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:31,099 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:31,100 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:31,100 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 200.20/159.37 [2019-03-28 12:46:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.37 [2019-03-28 12:46:31,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core 200.20/159.37 [2019-03-28 12:46:31,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.37 [2019-03-28 12:46:32,695 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 200.20/159.37 [2019-03-28 12:46:32,695 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:32,702 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:32,703 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:32,703 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 200.20/159.37 [2019-03-28 12:46:32,706 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 200.20/159.37 [2019-03-28 12:46:32,707 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:32,714 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:32,715 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:32,715 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 200.20/159.37 [2019-03-28 12:46:32,856 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:32,856 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 63 200.20/159.37 [2019-03-28 12:46:32,859 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:32,907 INFO L497 ElimStorePlain]: treesize reduction 43, result has 51.7 percent of original size 200.20/159.37 [2019-03-28 12:46:32,908 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:32,908 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:37 200.20/159.37 [2019-03-28 12:46:33,044 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 200.20/159.37 [2019-03-28 12:46:33,091 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:33,096 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 200.20/159.37 [2019-03-28 12:46:33,096 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:33,103 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 200.20/159.37 [2019-03-28 12:46:33,103 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:33,168 INFO L497 ElimStorePlain]: treesize reduction 3, result has 96.6 percent of original size 200.20/159.37 [2019-03-28 12:46:33,168 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 200.20/159.37 [2019-03-28 12:46:33,169 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:99, output treesize:57 200.20/159.37 [2019-03-28 12:46:33,555 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 200.20/159.37 [2019-03-28 12:46:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.37 [2019-03-28 12:46:34,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core 200.20/159.37 [2019-03-28 12:46:34,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.37 [2019-03-28 12:46:36,328 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 200.20/159.37 [2019-03-28 12:46:36,328 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:36,334 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.37 [2019-03-28 12:46:36,334 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.37 [2019-03-28 12:46:36,334 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 200.20/159.37 [2019-03-28 12:46:36,395 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 200.20/159.38 [2019-03-28 12:46:36,395 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:36,401 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:46:36,401 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:36,401 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 200.20/159.38 [2019-03-28 12:46:36,545 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:46:36,546 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 63 200.20/159.38 [2019-03-28 12:46:36,548 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:36,594 INFO L497 ElimStorePlain]: treesize reduction 35, result has 55.1 percent of original size 200.20/159.38 [2019-03-28 12:46:36,595 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:36,595 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:34 200.20/159.38 [2019-03-28 12:46:36,747 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 200.20/159.38 [2019-03-28 12:46:36,748 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:36,755 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 200.20/159.38 [2019-03-28 12:46:36,756 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:36,761 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 200.20/159.38 [2019-03-28 12:46:36,761 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:36,790 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:46:36,791 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 200.20/159.38 [2019-03-28 12:46:36,791 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:90, output treesize:51 200.20/159.38 [2019-03-28 12:46:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.20/159.38 [2019-03-28 12:46:38,136 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 200.20/159.38 [2019-03-28 12:46:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.38 [2019-03-28 12:46:38,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core 200.20/159.38 [2019-03-28 12:46:38,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.38 [2019-03-28 12:46:38,161 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 200.20/159.38 [2019-03-28 12:46:38,161 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:38,168 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:46:38,169 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:38,169 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 200.20/159.38 [2019-03-28 12:46:39,736 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:46:39,736 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 61 200.20/159.38 [2019-03-28 12:46:39,739 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:39,782 INFO L497 ElimStorePlain]: treesize reduction 35, result has 53.9 percent of original size 200.20/159.38 [2019-03-28 12:46:39,782 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:39,782 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:32 200.20/159.38 [2019-03-28 12:46:39,800 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 200.20/159.38 [2019-03-28 12:46:39,801 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:39,808 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 200.20/159.38 [2019-03-28 12:46:39,809 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:39,815 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 200.20/159.38 [2019-03-28 12:46:39,815 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:39,844 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:46:39,844 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 200.20/159.38 [2019-03-28 12:46:39,845 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:86, output treesize:47 200.20/159.38 [2019-03-28 12:46:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.38 [2019-03-28 12:46:39,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core 200.20/159.38 [2019-03-28 12:46:39,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.38 [2019-03-28 12:46:39,918 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 200.20/159.38 [2019-03-28 12:46:39,918 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:39,925 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:46:39,925 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:39,925 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 200.20/159.38 [2019-03-28 12:46:39,956 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:46:39,956 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 61 200.20/159.38 [2019-03-28 12:46:39,959 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:40,009 INFO L497 ElimStorePlain]: treesize reduction 41, result has 50.0 percent of original size 200.20/159.38 [2019-03-28 12:46:40,009 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:40,009 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:32 200.20/159.38 [2019-03-28 12:46:40,030 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 200.20/159.38 [2019-03-28 12:46:40,030 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:40,040 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 200.20/159.38 [2019-03-28 12:46:40,040 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:40,047 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 200.20/159.38 [2019-03-28 12:46:40,048 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:40,081 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:46:40,082 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 200.20/159.38 [2019-03-28 12:46:40,082 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:86, output treesize:47 200.20/159.38 [2019-03-28 12:46:40,146 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 37 200.20/159.38 [2019-03-28 12:46:40,146 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:40,153 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:46:40,153 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 50 treesize of output 37 200.20/159.38 [2019-03-28 12:46:40,154 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:40,182 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:46:40,183 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. 200.20/159.38 [2019-03-28 12:46:40,183 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:101, output treesize:57 200.20/159.38 [2019-03-28 12:46:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.38 [2019-03-28 12:46:40,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core 200.20/159.38 [2019-03-28 12:46:40,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.38 [2019-03-28 12:46:40,227 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:46:40,227 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 61 200.20/159.38 [2019-03-28 12:46:40,229 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:40,274 INFO L497 ElimStorePlain]: treesize reduction 41, result has 50.0 percent of original size 200.20/159.38 [2019-03-28 12:46:40,274 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:40,275 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:32 200.20/159.38 [2019-03-28 12:46:40,297 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 200.20/159.38 [2019-03-28 12:46:40,297 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:40,304 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 200.20/159.38 [2019-03-28 12:46:40,304 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:40,309 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 200.20/159.38 [2019-03-28 12:46:40,309 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:40,337 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:46:40,338 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 200.20/159.38 [2019-03-28 12:46:40,338 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:86, output treesize:47 200.20/159.38 [2019-03-28 12:46:40,398 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:46:40,398 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 50 treesize of output 37 200.20/159.38 [2019-03-28 12:46:40,398 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:40,403 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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 200.20/159.38 [2019-03-28 12:46:40,404 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:46:40,429 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:46:40,430 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. 200.20/159.38 [2019-03-28 12:46:40,430 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:101, output treesize:57 200.20/159.38 [2019-03-28 12:46:40,435 INFO L98 LoopCannibalizer]: 20 predicates before loop cannibalization 43 predicates after loop cannibalization 200.20/159.38 [2019-03-28 12:46:40,435 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 43 loop predicates 200.20/159.38 [2019-03-28 12:46:40,435 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 55 states and 69 transitions. cyclomatic complexity: 16 Second operand 14 states. 200.20/159.38 [2019-03-28 12:47:26,950 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 30 200.20/159.38 [2019-03-28 12:47:31,825 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 27 200.20/159.38 [2019-03-28 12:47:32,417 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 25 200.20/159.38 [2019-03-28 12:47:32,993 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 26 200.20/159.38 [2019-03-28 12:48:17,100 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 55 states and 69 transitions. cyclomatic complexity: 16. Second operand 14 states. Result 670 states and 747 transitions. Complement of second has 339 states. 200.20/159.38 [2019-03-28 12:48:17,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 62 states 2 stem states 57 non-accepting loop states 3 accepting loop states 200.20/159.38 [2019-03-28 12:48:17,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 200.20/159.38 [2019-03-28 12:48:17,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 135 transitions. 200.20/159.38 [2019-03-28 12:48:17,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 135 transitions. Stem has 6 letters. Loop has 24 letters. 200.20/159.38 [2019-03-28 12:48:17,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. 200.20/159.38 [2019-03-28 12:48:17,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 135 transitions. Stem has 30 letters. Loop has 24 letters. 200.20/159.38 [2019-03-28 12:48:17,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. 200.20/159.38 [2019-03-28 12:48:17,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 135 transitions. Stem has 6 letters. Loop has 48 letters. 200.20/159.38 [2019-03-28 12:48:17,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. 200.20/159.38 [2019-03-28 12:48:17,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 670 states and 747 transitions. 200.20/159.38 [2019-03-28 12:48:17,137 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 62 200.20/159.38 [2019-03-28 12:48:17,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 670 states to 248 states and 281 transitions. 200.20/159.38 [2019-03-28 12:48:17,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 200.20/159.38 [2019-03-28 12:48:17,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 200.20/159.38 [2019-03-28 12:48:17,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 248 states and 281 transitions. 200.20/159.38 [2019-03-28 12:48:17,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 200.20/159.38 [2019-03-28 12:48:17,140 INFO L706 BuchiCegarLoop]: Abstraction has 248 states and 281 transitions. 200.20/159.38 [2019-03-28 12:48:17,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states and 281 transitions. 200.20/159.38 [2019-03-28 12:48:17,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 66. 200.20/159.38 [2019-03-28 12:48:17,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. 200.20/159.38 [2019-03-28 12:48:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. 200.20/159.38 [2019-03-28 12:48:17,150 INFO L729 BuchiCegarLoop]: Abstraction has 66 states and 83 transitions. 200.20/159.38 [2019-03-28 12:48:17,150 INFO L609 BuchiCegarLoop]: Abstraction has 66 states and 83 transitions. 200.20/159.38 [2019-03-28 12:48:17,150 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 200.20/159.38 [2019-03-28 12:48:17,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 83 transitions. 200.20/159.38 [2019-03-28 12:48:17,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 200.20/159.38 [2019-03-28 12:48:17,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 200.20/159.38 [2019-03-28 12:48:17,152 INFO L119 BuchiIsEmpty]: Starting construction of run 200.20/159.38 [2019-03-28 12:48:17,153 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 200.20/159.38 [2019-03-28 12:48:17,153 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 200.20/159.38 [2019-03-28 12:48:17,154 INFO L794 eck$LassoCheckResult]: Stem: 5068#ULTIMATE.startENTRY [108] 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] 5062#L-1 [186] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 5063#L10 [94] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 5060#L10-1 [135] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 5061#L11 [109] L11-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 5069#L13-7 [120] L13-7-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 5086#L13 [209] L13-->L13-1: Formula: (and (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short5_2|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 5070#L13-1 200.20/159.38 [2019-03-28 12:48:17,154 INFO L796 eck$LassoCheckResult]: Loop: 5070#L13-1 [141] L13-1-->L13-5: Formula: |v_ULTIMATE.start_test_fun_#t~short5_3| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} AuxVars[] AssignedVars[] 5054#L13-5 [124] L13-5-->L14: Formula: |v_ULTIMATE.start_test_fun_#t~short5_9| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 5055#L14 [101] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{#valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 5076#L14-1 [97] L14-1-->L15: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem6_4|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_4|} OutVars{ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 5041#L15 [105] L15-->L15-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_17|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_17|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 5042#L15-1 [252] L15-1-->L17-3: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) 1) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_18 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| (- 1)))) |v_#memory_int_25|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~x_ref~0.base_18))) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_37|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_37|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 5078#L17-3 [144] L17-3-->L23: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 5072#L23 [254] L23-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1))) |v_#memory_int_29|)) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 5047#L13-7 [120] L13-7-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 5048#L13 [209] L13-->L13-1: Formula: (and (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short5_2|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 5070#L13-1 200.20/159.38 [2019-03-28 12:48:17,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.20/159.38 [2019-03-28 12:48:17,155 INFO L82 PathProgramCache]: Analyzing trace with hash -70043698, now seen corresponding path program 1 times 200.20/159.38 [2019-03-28 12:48:17,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.20/159.38 [2019-03-28 12:48:17,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.20/159.38 [2019-03-28 12:48:17,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.20/159.38 [2019-03-28 12:48:17,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.20/159.38 [2019-03-28 12:48:17,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.20/159.38 [2019-03-28 12:48:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.20/159.38 [2019-03-28 12:48:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.20/159.38 [2019-03-28 12:48:17,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.20/159.38 [2019-03-28 12:48:17,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1159583898, now seen corresponding path program 2 times 200.20/159.38 [2019-03-28 12:48:17,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.20/159.38 [2019-03-28 12:48:17,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.20/159.38 [2019-03-28 12:48:17,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.20/159.38 [2019-03-28 12:48:17,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.20/159.38 [2019-03-28 12:48:17,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.20/159.38 [2019-03-28 12:48:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.20/159.38 [2019-03-28 12:48:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.20/159.38 [2019-03-28 12:48:17,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.20/159.38 [2019-03-28 12:48:17,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1468022029, now seen corresponding path program 1 times 200.20/159.38 [2019-03-28 12:48:17,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.20/159.38 [2019-03-28 12:48:17,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.20/159.38 [2019-03-28 12:48:17,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.20/159.38 [2019-03-28 12:48:17,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 200.20/159.38 [2019-03-28 12:48:17,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.20/159.38 [2019-03-28 12:48:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.20/159.38 [2019-03-28 12:48:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.20/159.38 [2019-03-28 12:48:17,671 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 95 200.20/159.38 [2019-03-28 12:48:17,845 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 89 200.20/159.38 [2019-03-28 12:48:17,848 INFO L216 LassoAnalysis]: Preferences: 200.20/159.38 [2019-03-28 12:48:17,849 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 200.20/159.38 [2019-03-28 12:48:17,849 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 200.20/159.38 [2019-03-28 12:48:17,849 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 200.20/159.38 [2019-03-28 12:48:17,849 INFO L127 ssoRankerPreferences]: Use exernal solver: false 200.20/159.38 [2019-03-28 12:48:17,849 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 200.20/159.38 [2019-03-28 12:48:17,849 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 200.20/159.38 [2019-03-28 12:48:17,849 INFO L130 ssoRankerPreferences]: Path of dumped script: 200.20/159.38 [2019-03-28 12:48:17,849 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Lasso 200.20/159.38 [2019-03-28 12:48:17,849 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 200.20/159.38 [2019-03-28 12:48:17,850 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 200.20/159.38 [2019-03-28 12:48:17,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.38 [2019-03-28 12:48:17,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.38 [2019-03-28 12:48:18,120 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 200.20/159.38 [2019-03-28 12:48:18,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.38 [2019-03-28 12:48:18,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.38 [2019-03-28 12:48:18,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.38 [2019-03-28 12:48:18,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.38 [2019-03-28 12:48:18,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.38 [2019-03-28 12:48:18,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.38 [2019-03-28 12:48:18,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.38 [2019-03-28 12:48:18,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.38 [2019-03-28 12:48:18,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.38 [2019-03-28 12:48:18,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.38 [2019-03-28 12:48:18,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.38 [2019-03-28 12:48:18,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.38 [2019-03-28 12:48:18,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 200.20/159.38 [2019-03-28 12:48:18,581 INFO L300 LassoAnalysis]: Preprocessing complete. 200.20/159.38 [2019-03-28 12:48:18,582 INFO L497 LassoAnalysis]: Using template 'affine'. 200.20/159.38 [2019-03-28 12:48:18,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.38 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.38 Number of strict supporting invariants: 0 200.20/159.38 Number of non-strict supporting invariants: 1 200.20/159.38 Consider only non-deceasing supporting invariants: true 200.20/159.38 Simplify termination arguments: true 200.20/159.38 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.38 [2019-03-28 12:48:18,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.38 [2019-03-28 12:48:18,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 200.20/159.38 [2019-03-28 12:48:18,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.38 [2019-03-28 12:48:18,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.38 [2019-03-28 12:48:18,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.38 [2019-03-28 12:48:18,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 200.20/159.38 [2019-03-28 12:48:18,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 200.20/159.38 [2019-03-28 12:48:18,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.38 [2019-03-28 12:48:18,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.38 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.38 Number of strict supporting invariants: 0 200.20/159.38 Number of non-strict supporting invariants: 1 200.20/159.38 Consider only non-deceasing supporting invariants: true 200.20/159.38 Simplify termination arguments: true 200.20/159.38 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.38 [2019-03-28 12:48:18,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.38 [2019-03-28 12:48:18,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.38 [2019-03-28 12:48:18,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.38 [2019-03-28 12:48:18,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.38 [2019-03-28 12:48:18,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.38 [2019-03-28 12:48:18,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.38 [2019-03-28 12:48:18,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.38 [2019-03-28 12:48:18,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.38 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.38 Number of strict supporting invariants: 0 200.20/159.38 Number of non-strict supporting invariants: 1 200.20/159.38 Consider only non-deceasing supporting invariants: true 200.20/159.38 Simplify termination arguments: true 200.20/159.38 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.38 [2019-03-28 12:48:18,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.38 [2019-03-28 12:48:18,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.38 [2019-03-28 12:48:18,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.38 [2019-03-28 12:48:18,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.38 [2019-03-28 12:48:18,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.38 [2019-03-28 12:48:18,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.38 [2019-03-28 12:48:18,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.38 [2019-03-28 12:48:18,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.38 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.38 Number of strict supporting invariants: 0 200.20/159.38 Number of non-strict supporting invariants: 1 200.20/159.38 Consider only non-deceasing supporting invariants: true 200.20/159.38 Simplify termination arguments: true 200.20/159.38 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.38 [2019-03-28 12:48:18,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.38 [2019-03-28 12:48:18,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.38 [2019-03-28 12:48:18,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.38 [2019-03-28 12:48:18,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.38 [2019-03-28 12:48:18,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.38 [2019-03-28 12:48:18,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.38 [2019-03-28 12:48:18,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.38 [2019-03-28 12:48:18,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.38 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.38 Number of strict supporting invariants: 0 200.20/159.38 Number of non-strict supporting invariants: 1 200.20/159.38 Consider only non-deceasing supporting invariants: true 200.20/159.38 Simplify termination arguments: true 200.20/159.38 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.38 [2019-03-28 12:48:18,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.38 [2019-03-28 12:48:18,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.38 [2019-03-28 12:48:18,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.38 [2019-03-28 12:48:18,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.38 [2019-03-28 12:48:18,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.38 [2019-03-28 12:48:18,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.38 [2019-03-28 12:48:18,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.38 [2019-03-28 12:48:18,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.38 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.38 Number of strict supporting invariants: 0 200.20/159.38 Number of non-strict supporting invariants: 1 200.20/159.38 Consider only non-deceasing supporting invariants: true 200.20/159.38 Simplify termination arguments: true 200.20/159.38 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.38 [2019-03-28 12:48:18,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.38 [2019-03-28 12:48:18,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.38 [2019-03-28 12:48:18,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.38 [2019-03-28 12:48:18,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.38 [2019-03-28 12:48:18,605 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.38 [2019-03-28 12:48:18,605 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.38 [2019-03-28 12:48:18,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.38 [2019-03-28 12:48:18,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.38 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.38 Number of strict supporting invariants: 0 200.20/159.38 Number of non-strict supporting invariants: 1 200.20/159.38 Consider only non-deceasing supporting invariants: true 200.20/159.38 Simplify termination arguments: true 200.20/159.38 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.38 [2019-03-28 12:48:18,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.38 [2019-03-28 12:48:18,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.38 [2019-03-28 12:48:18,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.38 [2019-03-28 12:48:18,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.38 [2019-03-28 12:48:18,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.38 [2019-03-28 12:48:18,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.38 [2019-03-28 12:48:18,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.38 [2019-03-28 12:48:18,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.38 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.38 Number of strict supporting invariants: 0 200.20/159.38 Number of non-strict supporting invariants: 1 200.20/159.38 Consider only non-deceasing supporting invariants: true 200.20/159.38 Simplify termination arguments: true 200.20/159.38 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.38 [2019-03-28 12:48:18,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.38 [2019-03-28 12:48:18,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.38 [2019-03-28 12:48:18,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.38 [2019-03-28 12:48:18,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.38 [2019-03-28 12:48:18,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.38 [2019-03-28 12:48:18,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.38 [2019-03-28 12:48:18,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.38 [2019-03-28 12:48:18,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.38 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.38 Number of strict supporting invariants: 0 200.20/159.38 Number of non-strict supporting invariants: 1 200.20/159.38 Consider only non-deceasing supporting invariants: true 200.20/159.38 Simplify termination arguments: true 200.20/159.38 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.38 [2019-03-28 12:48:18,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.38 [2019-03-28 12:48:18,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.38 [2019-03-28 12:48:18,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.38 [2019-03-28 12:48:18,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.38 [2019-03-28 12:48:18,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.38 [2019-03-28 12:48:18,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.38 [2019-03-28 12:48:18,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.38 [2019-03-28 12:48:18,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.38 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.38 Number of strict supporting invariants: 0 200.20/159.38 Number of non-strict supporting invariants: 1 200.20/159.38 Consider only non-deceasing supporting invariants: true 200.20/159.38 Simplify termination arguments: true 200.20/159.38 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.38 [2019-03-28 12:48:18,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.38 [2019-03-28 12:48:18,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.38 [2019-03-28 12:48:18,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.38 [2019-03-28 12:48:18,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.38 [2019-03-28 12:48:18,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.38 [2019-03-28 12:48:18,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.38 [2019-03-28 12:48:18,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 200.20/159.38 [2019-03-28 12:48:18,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 200.20/159.38 Termination analysis: LINEAR_WITH_GUESSES 200.20/159.38 Number of strict supporting invariants: 0 200.20/159.38 Number of non-strict supporting invariants: 1 200.20/159.38 Consider only non-deceasing supporting invariants: true 200.20/159.38 Simplify termination arguments: true 200.20/159.38 Simplify supporting invariants: trueOverapproximate stem: false 200.20/159.38 [2019-03-28 12:48:18,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. 200.20/159.38 [2019-03-28 12:48:18,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 200.20/159.38 [2019-03-28 12:48:18,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 200.20/159.38 [2019-03-28 12:48:18,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 200.20/159.38 [2019-03-28 12:48:18,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 200.20/159.38 [2019-03-28 12:48:18,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 200.20/159.38 [2019-03-28 12:48:18,644 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 200.20/159.38 [2019-03-28 12:48:18,647 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 200.20/159.38 [2019-03-28 12:48:18,647 INFO L444 ModelExtractionUtils]: 16 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. 200.20/159.38 [2019-03-28 12:48:18,647 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 200.20/159.38 [2019-03-28 12:48:18,648 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 200.20/159.38 [2019-03-28 12:48:18,648 INFO L518 LassoAnalysis]: Proved termination. 200.20/159.38 [2019-03-28 12:48:18,648 INFO L520 LassoAnalysis]: Termination argument consisting of: 200.20/159.38 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4 200.20/159.38 Supporting invariants [] 200.20/159.38 [2019-03-28 12:48:18,712 INFO L297 tatePredicateManager]: 19 out of 20 supporting invariants were superfluous and have been removed 200.20/159.38 [2019-03-28 12:48:18,715 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 200.20/159.38 [2019-03-28 12:48:18,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.20/159.38 [2019-03-28 12:48:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.38 [2019-03-28 12:48:18,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjunts are in the unsatisfiable core 200.20/159.38 [2019-03-28 12:48:18,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.38 [2019-03-28 12:48:18,782 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 200.20/159.38 [2019-03-28 12:48:18,783 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:18,789 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:48:18,789 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:18,789 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 200.20/159.38 [2019-03-28 12:48:18,812 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:48:18,812 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 200.20/159.38 [2019-03-28 12:48:18,813 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 200.20/159.38 [2019-03-28 12:48:18,820 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:48:18,820 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:18,820 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:10 200.20/159.38 [2019-03-28 12:48:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.38 [2019-03-28 12:48:18,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 200.20/159.38 [2019-03-28 12:48:18,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.38 [2019-03-28 12:48:18,920 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 200.20/159.38 [2019-03-28 12:48:18,920 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:18,930 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:48:18,930 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:18,931 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 200.20/159.38 [2019-03-28 12:48:18,956 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 200.20/159.38 [2019-03-28 12:48:18,956 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:18,966 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:48:18,966 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:18,966 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 200.20/159.38 [2019-03-28 12:48:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 200.20/159.38 [2019-03-28 12:48:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.38 [2019-03-28 12:48:19,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 200.20/159.38 [2019-03-28 12:48:19,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.38 [2019-03-28 12:48:19,196 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 200.20/159.38 [2019-03-28 12:48:19,196 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:19,203 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:48:19,203 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:19,203 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 200.20/159.38 [2019-03-28 12:48:19,231 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 200.20/159.38 [2019-03-28 12:48:19,232 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:19,238 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:48:19,238 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:19,238 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 200.20/159.38 [2019-03-28 12:48:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.20/159.38 [2019-03-28 12:48:19,317 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 200.20/159.38 [2019-03-28 12:48:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.38 [2019-03-28 12:48:19,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 200.20/159.38 [2019-03-28 12:48:19,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.38 [2019-03-28 12:48:19,331 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 200.20/159.38 [2019-03-28 12:48:19,331 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:19,338 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:48:19,338 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:19,338 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 200.20/159.38 [2019-03-28 12:48:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.38 [2019-03-28 12:48:19,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 200.20/159.38 [2019-03-28 12:48:19,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.38 [2019-03-28 12:48:19,384 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 200.20/159.38 [2019-03-28 12:48:19,384 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:19,391 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:48:19,392 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:19,392 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 200.20/159.38 [2019-03-28 12:48:19,401 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 200.20/159.38 [2019-03-28 12:48:19,402 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:19,409 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:48:19,409 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:19,409 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 200.20/159.38 [2019-03-28 12:48:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.38 [2019-03-28 12:48:19,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 200.20/159.38 [2019-03-28 12:48:19,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.38 [2019-03-28 12:48:19,424 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 200.20/159.38 [2019-03-28 12:48:19,424 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:19,431 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:48:19,432 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:19,432 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 200.20/159.38 [2019-03-28 12:48:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.38 [2019-03-28 12:48:19,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core 200.20/159.38 [2019-03-28 12:48:19,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.38 [2019-03-28 12:48:19,446 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 200.20/159.38 [2019-03-28 12:48:19,446 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:19,453 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:48:19,454 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:19,454 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 200.20/159.38 [2019-03-28 12:48:19,458 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 200.20/159.38 [2019-03-28 12:48:19,458 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:19,466 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:48:19,466 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:19,466 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 200.20/159.38 [2019-03-28 12:48:19,467 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 8 predicates after loop cannibalization 200.20/159.38 [2019-03-28 12:48:19,467 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 8 loop predicates 200.20/159.38 [2019-03-28 12:48:19,468 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 66 states and 83 transitions. cyclomatic complexity: 20 Second operand 10 states. 200.20/159.38 [2019-03-28 12:48:20,214 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 66 states and 83 transitions. cyclomatic complexity: 20. Second operand 10 states. Result 450 states and 513 transitions. Complement of second has 97 states. 200.20/159.38 [2019-03-28 12:48:20,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 25 states 5 stem states 18 non-accepting loop states 2 accepting loop states 200.20/159.38 [2019-03-28 12:48:20,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 200.20/159.38 [2019-03-28 12:48:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 118 transitions. 200.20/159.38 [2019-03-28 12:48:20,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 118 transitions. Stem has 7 letters. Loop has 10 letters. 200.20/159.38 [2019-03-28 12:48:20,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. 200.20/159.38 [2019-03-28 12:48:20,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 118 transitions. Stem has 17 letters. Loop has 10 letters. 200.20/159.38 [2019-03-28 12:48:20,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. 200.20/159.38 [2019-03-28 12:48:20,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 118 transitions. Stem has 7 letters. Loop has 20 letters. 200.20/159.38 [2019-03-28 12:48:20,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. 200.20/159.38 [2019-03-28 12:48:20,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 450 states and 513 transitions. 200.20/159.38 [2019-03-28 12:48:20,227 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 200.20/159.38 [2019-03-28 12:48:20,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 450 states to 169 states and 196 transitions. 200.20/159.38 [2019-03-28 12:48:20,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 200.20/159.38 [2019-03-28 12:48:20,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 200.20/159.38 [2019-03-28 12:48:20,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 196 transitions. 200.20/159.38 [2019-03-28 12:48:20,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 200.20/159.38 [2019-03-28 12:48:20,229 INFO L706 BuchiCegarLoop]: Abstraction has 169 states and 196 transitions. 200.20/159.38 [2019-03-28 12:48:20,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 196 transitions. 200.20/159.38 [2019-03-28 12:48:20,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 78. 200.20/159.38 [2019-03-28 12:48:20,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. 200.20/159.38 [2019-03-28 12:48:20,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. 200.20/159.38 [2019-03-28 12:48:20,232 INFO L729 BuchiCegarLoop]: Abstraction has 78 states and 96 transitions. 200.20/159.38 [2019-03-28 12:48:20,233 INFO L609 BuchiCegarLoop]: Abstraction has 78 states and 96 transitions. 200.20/159.38 [2019-03-28 12:48:20,233 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 200.20/159.38 [2019-03-28 12:48:20,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 96 transitions. 200.20/159.38 [2019-03-28 12:48:20,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 200.20/159.38 [2019-03-28 12:48:20,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 200.20/159.38 [2019-03-28 12:48:20,234 INFO L119 BuchiIsEmpty]: Starting construction of run 200.20/159.38 [2019-03-28 12:48:20,234 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 200.20/159.38 [2019-03-28 12:48:20,234 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 200.20/159.38 [2019-03-28 12:48:20,235 INFO L794 eck$LassoCheckResult]: Stem: 6029#ULTIMATE.startENTRY [108] 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] 6022#L-1 [186] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 6023#L10 [94] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 6020#L10-1 [135] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 6021#L11 [109] L11-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 6049#L13-7 [120] L13-7-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 6050#L13 [208] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (>= 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 6069#L13-1 [142] L13-1-->L13-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_4|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} AuxVars[] AssignedVars[] 6068#L13-3 [138] L13-3-->L13-4: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 6067#L13-4 [218] L13-4-->L13-5: Formula: (and |v_ULTIMATE.start_test_fun_#t~short5_5| (< 0 |v_ULTIMATE.start_test_fun_#t~mem4_3|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 6066#L13-5 [124] L13-5-->L14: Formula: |v_ULTIMATE.start_test_fun_#t~short5_9| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 6053#L14 [101] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{#valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 6051#L14-1 [164] L14-1-->L17: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem6_6|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 6011#L17 [132] L17-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem8_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_23|} OutVars{#valid=|v_#valid_23|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 6005#L17-1 [130] L17-1-->L18: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem8_4|) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_4|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 6006#L18 [89] L18-->L18-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 6012#L18-1 [253] L18-1-->L17-3: Formula: (and (= 1 (select |v_#valid_48| v_ULTIMATE.start_test_fun_~y_ref~0.base_18)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_13) (= |v_#memory_int_27| (store |v_#memory_int_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_18 (store (select |v_#memory_int_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_18) v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~y_ref~0.base_18))) InVars {#valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13} OutVars{#valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 6013#L17-3 [144] L17-3-->L23: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 6046#L23 200.20/159.38 [2019-03-28 12:48:20,236 INFO L796 eck$LassoCheckResult]: Loop: 6046#L23 [254] L23-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1))) |v_#memory_int_29|)) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 6007#L13-7 [120] L13-7-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 6008#L13 [209] L13-->L13-1: Formula: (and (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short5_2|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 6032#L13-1 [141] L13-1-->L13-5: Formula: |v_ULTIMATE.start_test_fun_#t~short5_3| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} AuxVars[] AssignedVars[] 6014#L13-5 [124] L13-5-->L14: Formula: |v_ULTIMATE.start_test_fun_#t~short5_9| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 6015#L14 [101] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{#valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 6039#L14-1 [97] L14-1-->L15: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem6_4|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_4|} OutVars{ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 6001#L15 [105] L15-->L15-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_17|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_17|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 6002#L15-1 [252] L15-1-->L17-3: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) 1) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_18 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| (- 1)))) |v_#memory_int_25|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~x_ref~0.base_18))) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_37|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_37|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 6043#L17-3 [144] L17-3-->L23: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 6046#L23 200.20/159.38 [2019-03-28 12:48:20,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.20/159.38 [2019-03-28 12:48:20,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1643051708, now seen corresponding path program 1 times 200.20/159.38 [2019-03-28 12:48:20,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.20/159.38 [2019-03-28 12:48:20,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.20/159.38 [2019-03-28 12:48:20,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.20/159.38 [2019-03-28 12:48:20,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.20/159.38 [2019-03-28 12:48:20,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.20/159.38 [2019-03-28 12:48:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.20/159.38 [2019-03-28 12:48:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.20/159.38 [2019-03-28 12:48:20,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.20/159.38 [2019-03-28 12:48:20,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1087451388, now seen corresponding path program 3 times 200.20/159.38 [2019-03-28 12:48:20,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.20/159.38 [2019-03-28 12:48:20,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.20/159.38 [2019-03-28 12:48:20,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.20/159.38 [2019-03-28 12:48:20,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 200.20/159.38 [2019-03-28 12:48:20,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.20/159.38 [2019-03-28 12:48:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.20/159.38 [2019-03-28 12:48:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 200.20/159.38 [2019-03-28 12:48:20,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 200.20/159.38 [2019-03-28 12:48:20,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1392853377, now seen corresponding path program 2 times 200.20/159.38 [2019-03-28 12:48:20,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 200.20/159.38 [2019-03-28 12:48:20,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 200.20/159.38 [2019-03-28 12:48:20,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.20/159.38 [2019-03-28 12:48:20,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 200.20/159.38 [2019-03-28 12:48:20,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 200.20/159.38 [2019-03-28 12:48:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 200.20/159.38 [2019-03-28 12:48:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 200.20/159.38 [2019-03-28 12:48:20,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 200.20/159.38 [2019-03-28 12:48:20,353 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 200.20/159.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 200.20/159.38 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 200.20/159.38 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 200.20/159.38 [2019-03-28 12:48:20,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 200.20/159.38 [2019-03-28 12:48:20,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 200.20/159.38 [2019-03-28 12:48:20,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 200.20/159.38 [2019-03-28 12:48:20,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 16 conjunts are in the unsatisfiable core 200.20/159.38 [2019-03-28 12:48:20,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... 200.20/159.38 [2019-03-28 12:48:20,412 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:48:20,413 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 200.20/159.38 [2019-03-28 12:48:20,413 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:20,419 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:48:20,419 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:20,419 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 200.20/159.38 [2019-03-28 12:48:20,478 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 200.20/159.38 [2019-03-28 12:48:20,479 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:20,490 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:48:20,490 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:20,490 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:12 200.20/159.38 [2019-03-28 12:48:20,495 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 200.20/159.38 [2019-03-28 12:48:20,495 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:20,502 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:48:20,503 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:20,503 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:25, output treesize:7 200.20/159.38 [2019-03-28 12:48:20,506 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 200.20/159.38 [2019-03-28 12:48:20,507 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:20,508 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 200.20/159.38 [2019-03-28 12:48:20,509 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 200.20/159.38 [2019-03-28 12:48:20,509 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 200.20/159.38 [2019-03-28 12:48:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 200.20/159.38 [2019-03-28 12:48:20,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 200.20/159.38 [2019-03-28 12:48:20,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 200.20/159.38 [2019-03-28 12:48:20,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 200.20/159.38 [2019-03-28 12:48:20,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 200.20/159.38 [2019-03-28 12:48:20,669 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. cyclomatic complexity: 22 Second operand 11 states. 200.20/159.38 [2019-03-28 12:48:20,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 200.20/159.38 [2019-03-28 12:48:20,922 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. 200.20/159.38 [2019-03-28 12:48:20,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 200.20/159.38 [2019-03-28 12:48:20,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 73 transitions. 200.20/159.38 [2019-03-28 12:48:20,928 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 200.20/159.38 [2019-03-28 12:48:20,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 0 states and 0 transitions. 200.20/159.38 [2019-03-28 12:48:20,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 200.20/159.38 [2019-03-28 12:48:20,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 200.20/159.38 [2019-03-28 12:48:20,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 200.20/159.38 [2019-03-28 12:48:20,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 200.20/159.38 [2019-03-28 12:48:20,929 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 200.20/159.38 [2019-03-28 12:48:20,929 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 200.20/159.38 [2019-03-28 12:48:20,929 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 200.20/159.38 [2019-03-28 12:48:20,929 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ 200.20/159.38 [2019-03-28 12:48:20,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 200.20/159.38 [2019-03-28 12:48:20,929 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 200.20/159.38 [2019-03-28 12:48:20,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 200.20/159.38 [2019-03-28 12:48:20,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:48:20 BasicIcfg 200.20/159.38 [2019-03-28 12:48:20,936 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 200.20/159.38 [2019-03-28 12:48:20,937 INFO L168 Benchmark]: Toolchain (without parser) took 154937.24 ms. Allocated memory was 649.6 MB in the beginning and 968.4 MB in the end (delta: 318.8 MB). Free memory was 564.9 MB in the beginning and 716.7 MB in the end (delta: -151.8 MB). Peak memory consumption was 167.0 MB. Max. memory is 50.3 GB. 200.20/159.38 [2019-03-28 12:48:20,938 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 584.3 MB. There was no memory consumed. Max. memory is 50.3 GB. 200.20/159.38 [2019-03-28 12:48:20,939 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.64 ms. Allocated memory was 649.6 MB in the beginning and 672.7 MB in the end (delta: 23.1 MB). Free memory was 564.9 MB in the beginning and 639.4 MB in the end (delta: -74.5 MB). Peak memory consumption was 31.4 MB. Max. memory is 50.3 GB. 200.20/159.38 [2019-03-28 12:48:20,939 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.94 ms. Allocated memory is still 672.7 MB. Free memory was 639.4 MB in the beginning and 635.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 200.20/159.38 [2019-03-28 12:48:20,939 INFO L168 Benchmark]: Boogie Preprocessor took 25.75 ms. Allocated memory is still 672.7 MB. Free memory was 635.5 MB in the beginning and 634.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 200.20/159.38 [2019-03-28 12:48:20,940 INFO L168 Benchmark]: RCFGBuilder took 416.41 ms. Allocated memory is still 672.7 MB. Free memory was 634.4 MB in the beginning and 607.9 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 50.3 GB. 200.20/159.38 [2019-03-28 12:48:20,940 INFO L168 Benchmark]: BlockEncodingV2 took 140.49 ms. Allocated memory is still 672.7 MB. Free memory was 607.9 MB in the beginning and 596.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 50.3 GB. 200.20/159.38 [2019-03-28 12:48:20,940 INFO L168 Benchmark]: TraceAbstraction took 1701.32 ms. Allocated memory is still 672.7 MB. Free memory was 595.0 MB in the beginning and 404.7 MB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 50.3 GB. 200.20/159.38 [2019-03-28 12:48:20,940 INFO L168 Benchmark]: BuchiAutomizer took 152292.35 ms. Allocated memory was 672.7 MB in the beginning and 968.4 MB in the end (delta: 295.7 MB). Free memory was 404.7 MB in the beginning and 716.7 MB in the end (delta: -312.0 MB). There was no memory consumed. Max. memory is 50.3 GB. 200.20/159.38 [2019-03-28 12:48:20,943 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 200.20/159.38 --- Results --- 200.20/159.38 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 200.20/159.38 - StatisticsResult: Initial Icfg 200.20/159.38 58 locations, 62 edges 200.20/159.38 - StatisticsResult: Encoded RCFG 200.20/159.38 50 locations, 90 edges 200.20/159.38 * Results from de.uni_freiburg.informatik.ultimate.core: 200.20/159.38 - StatisticsResult: Toolchain Benchmarks 200.20/159.38 Benchmark results are: 200.20/159.38 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 584.3 MB. There was no memory consumed. Max. memory is 50.3 GB. 200.20/159.38 * CACSL2BoogieTranslator took 311.64 ms. Allocated memory was 649.6 MB in the beginning and 672.7 MB in the end (delta: 23.1 MB). Free memory was 564.9 MB in the beginning and 639.4 MB in the end (delta: -74.5 MB). Peak memory consumption was 31.4 MB. Max. memory is 50.3 GB. 200.20/159.38 * Boogie Procedure Inliner took 43.94 ms. Allocated memory is still 672.7 MB. Free memory was 639.4 MB in the beginning and 635.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 200.20/159.38 * Boogie Preprocessor took 25.75 ms. Allocated memory is still 672.7 MB. Free memory was 635.5 MB in the beginning and 634.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 200.20/159.38 * RCFGBuilder took 416.41 ms. Allocated memory is still 672.7 MB. Free memory was 634.4 MB in the beginning and 607.9 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 50.3 GB. 200.20/159.38 * BlockEncodingV2 took 140.49 ms. Allocated memory is still 672.7 MB. Free memory was 607.9 MB in the beginning and 596.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 50.3 GB. 200.20/159.38 * TraceAbstraction took 1701.32 ms. Allocated memory is still 672.7 MB. Free memory was 595.0 MB in the beginning and 404.7 MB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 50.3 GB. 200.20/159.38 * BuchiAutomizer took 152292.35 ms. Allocated memory was 672.7 MB in the beginning and 968.4 MB in the end (delta: 295.7 MB). Free memory was 404.7 MB in the beginning and 716.7 MB in the end (delta: -312.0 MB). There was no memory consumed. Max. memory is 50.3 GB. 200.20/159.38 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 200.20/159.38 - GenericResult: Unfinished Backtranslation 200.20/159.38 unknown boogie variable #length 200.20/159.38 - GenericResult: Unfinished Backtranslation 200.20/159.38 unknown boogie variable #length 200.20/159.38 - GenericResult: Unfinished Backtranslation 200.20/159.38 unknown boogie variable #length 200.20/159.38 - GenericResult: Unfinished Backtranslation 200.20/159.38 unknown boogie variable #length 200.20/159.38 - GenericResult: Unfinished Backtranslation 200.20/159.38 unknown boogie variable #length 200.20/159.38 - GenericResult: Unfinished Backtranslation 200.20/159.38 unknown boogie variable #length 200.20/159.38 - GenericResult: Unfinished Backtranslation 200.20/159.38 unknown boogie variable #memory_int 200.20/159.38 - GenericResult: Unfinished Backtranslation 200.20/159.38 unknown boogie variable #memory_int 200.20/159.38 - GenericResult: Unfinished Backtranslation 200.20/159.38 unknown boogie variable #memory_int 200.20/159.38 - GenericResult: Unfinished Backtranslation 200.20/159.38 unknown boogie variable #memory_int 200.20/159.38 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 200.20/159.38 - PositiveResult [Line: 17]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 17]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 18]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 18]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 18]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 10]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 18]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 23]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 10]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 23]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 11]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 23]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 11]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 12]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 23]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 25]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 12]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 25]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 13]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 13]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 13]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 13]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 14]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 14]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 15]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 15]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 15]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - PositiveResult [Line: 15]: pointer dereference always succeeds 200.20/159.38 For all program executions holds that pointer dereference always succeeds at this location 200.20/159.38 - AllSpecificationsHoldResult: All specifications hold 200.20/159.38 28 specifications checked. All of them hold 200.20/159.38 - InvariantResult [Line: 12]: Loop Invariant 200.20/159.38 [2019-03-28 12:48:20,949 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 200.20/159.38 [2019-03-28 12:48:20,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 200.20/159.38 [2019-03-28 12:48:20,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 200.20/159.38 [2019-03-28 12:48:20,951 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 200.20/159.38 [2019-03-28 12:48:20,951 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 200.20/159.38 [2019-03-28 12:48:20,951 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 200.20/159.38 Derived loop invariant: (((((((4 == unknown-#length-unknown[x_ref] && 0 == c) && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[c]) && 1 == \valid[c] 200.20/159.38 - StatisticsResult: Ultimate Automizer benchmark data 200.20/159.38 CFG has 1 procedures, 50 locations, 28 error locations. SAFE Result, 1.6s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 89 SDtfs, 414 SDslu, 6 SDs, 0 SdLazy, 418 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 200.20/159.38 - StatisticsResult: Constructed decomposition of program 200.20/159.38 Your program was decomposed into 9 terminating modules (5 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 29 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 21 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 62 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 25 locations. 5 modules have a trivial ranking function, the largest among these consists of 11 locations. 200.20/159.38 - StatisticsResult: Timing statistics 200.20/159.38 BüchiAutomizer plugin needed 152.2s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 8.0s. Construction of modules took 68.5s. Büchi inclusion checks took 75.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 645 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 78 states and ocurred in iteration 8. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 6/8 HoareTripleCheckerStatistics: 195 SDtfs, 997 SDslu, 989 SDs, 0 SdLazy, 3312 SolverSat, 260 SolverUnsat, 22 SolverUnknown, 0 SolverNotchecked, 68.5s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital473 mio100 ax100 hnf100 lsp97 ukn49 mio100 lsp36 div100 bol100 ite100 ukn100 eq186 hnf88 smp96 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 200.20/159.38 - TerminationAnalysisResult: Termination proven 200.20/159.38 Buchi Automizer proved that your program is terminating 200.20/159.38 RESULT: Ultimate proved your program to be correct! 200.20/159.38 !SESSION 2019-03-28 12:45:42.719 ----------------------------------------------- 200.20/159.38 eclipse.buildId=unknown 200.20/159.38 java.version=1.8.0_181 200.20/159.38 java.vendor=Oracle Corporation 200.20/159.38 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 200.20/159.38 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 200.20/159.38 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 200.20/159.38 200.20/159.38 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:48:21.176 200.20/159.38 !MESSAGE The workspace will exit with unsaved changes in this session. 200.20/159.38 Received shutdown request... 200.20/159.38 Ultimate: 200.20/159.38 GTK+ Version Check 200.20/159.38 EOF