96.97/53.37 YES 96.97/53.37 96.97/53.37 Ultimate: Cannot open display: 96.97/53.37 This is Ultimate 0.1.24-8dc7c08-m 96.97/53.37 [2019-03-28 12:43:14,911 INFO L170 SettingsManager]: Resetting all preferences to default values... 96.97/53.37 [2019-03-28 12:43:14,913 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 96.97/53.37 [2019-03-28 12:43:14,925 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 96.97/53.37 [2019-03-28 12:43:14,925 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 96.97/53.37 [2019-03-28 12:43:14,926 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 96.97/53.37 [2019-03-28 12:43:14,927 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 96.97/53.37 [2019-03-28 12:43:14,929 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 96.97/53.37 [2019-03-28 12:43:14,930 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 96.97/53.37 [2019-03-28 12:43:14,931 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 96.97/53.37 [2019-03-28 12:43:14,932 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 96.97/53.37 [2019-03-28 12:43:14,932 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 96.97/53.37 [2019-03-28 12:43:14,933 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 96.97/53.37 [2019-03-28 12:43:14,934 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 96.97/53.37 [2019-03-28 12:43:14,935 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 96.97/53.37 [2019-03-28 12:43:14,936 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 96.97/53.37 [2019-03-28 12:43:14,937 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 96.97/53.37 [2019-03-28 12:43:14,938 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 96.97/53.37 [2019-03-28 12:43:14,940 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 96.97/53.37 [2019-03-28 12:43:14,941 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 96.97/53.37 [2019-03-28 12:43:14,942 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 96.97/53.37 [2019-03-28 12:43:14,943 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 96.97/53.37 [2019-03-28 12:43:14,946 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 96.97/53.37 [2019-03-28 12:43:14,946 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 96.97/53.37 [2019-03-28 12:43:14,946 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 96.97/53.37 [2019-03-28 12:43:14,947 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 96.97/53.37 [2019-03-28 12:43:14,948 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 96.97/53.37 [2019-03-28 12:43:14,949 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 96.97/53.37 [2019-03-28 12:43:14,949 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 96.97/53.37 [2019-03-28 12:43:14,950 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 96.97/53.37 [2019-03-28 12:43:14,950 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 96.97/53.37 [2019-03-28 12:43:14,951 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 96.97/53.37 [2019-03-28 12:43:14,952 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 96.97/53.37 [2019-03-28 12:43:14,952 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 96.97/53.37 [2019-03-28 12:43:14,953 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 96.97/53.37 [2019-03-28 12:43:14,953 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 96.97/53.37 [2019-03-28 12:43:14,953 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 96.97/53.37 [2019-03-28 12:43:14,954 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 96.97/53.37 [2019-03-28 12:43:14,955 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 96.97/53.37 [2019-03-28 12:43:14,955 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 96.97/53.37 [2019-03-28 12:43:14,970 INFO L110 SettingsManager]: Loading preferences was successful 96.97/53.37 [2019-03-28 12:43:14,971 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 96.97/53.37 [2019-03-28 12:43:14,972 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 96.97/53.37 [2019-03-28 12:43:14,972 INFO L133 SettingsManager]: * Rewrite not-equals=true 96.97/53.37 [2019-03-28 12:43:14,972 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 96.97/53.37 [2019-03-28 12:43:14,972 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 96.97/53.37 [2019-03-28 12:43:14,973 INFO L133 SettingsManager]: * Use SBE=true 96.97/53.37 [2019-03-28 12:43:14,973 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 96.97/53.37 [2019-03-28 12:43:14,973 INFO L133 SettingsManager]: * Use old map elimination=false 96.97/53.37 [2019-03-28 12:43:14,973 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 96.97/53.37 [2019-03-28 12:43:14,973 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 96.97/53.37 [2019-03-28 12:43:14,973 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 96.97/53.37 [2019-03-28 12:43:14,974 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 96.97/53.37 [2019-03-28 12:43:14,974 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 96.97/53.37 [2019-03-28 12:43:14,974 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 96.97/53.37 [2019-03-28 12:43:14,974 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 96.97/53.37 [2019-03-28 12:43:14,974 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 96.97/53.37 [2019-03-28 12:43:14,974 INFO L133 SettingsManager]: * Check division by zero=IGNORE 96.97/53.37 [2019-03-28 12:43:14,975 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 96.97/53.37 [2019-03-28 12:43:14,975 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 96.97/53.37 [2019-03-28 12:43:14,975 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 96.97/53.37 [2019-03-28 12:43:14,975 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 96.97/53.37 [2019-03-28 12:43:14,975 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 96.97/53.37 [2019-03-28 12:43:14,976 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 96.97/53.37 [2019-03-28 12:43:14,976 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 96.97/53.37 [2019-03-28 12:43:14,976 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 96.97/53.37 [2019-03-28 12:43:14,976 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 96.97/53.37 [2019-03-28 12:43:14,976 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 96.97/53.37 [2019-03-28 12:43:14,976 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 96.97/53.37 [2019-03-28 12:43:15,003 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 96.97/53.37 [2019-03-28 12:43:15,017 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 96.97/53.37 [2019-03-28 12:43:15,020 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 96.97/53.37 [2019-03-28 12:43:15,022 INFO L271 PluginConnector]: Initializing CDTParser... 96.97/53.37 [2019-03-28 12:43:15,022 INFO L276 PluginConnector]: CDTParser initialized 96.97/53.37 [2019-03-28 12:43:15,023 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 96.97/53.37 [2019-03-28 12:43:15,087 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/e1c81277e47b4ac09941c87d0c98b38f/FLAGc40d5c650 96.97/53.37 [2019-03-28 12:43:15,436 INFO L307 CDTParser]: Found 1 translation units. 96.97/53.37 [2019-03-28 12:43:15,437 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 96.97/53.37 [2019-03-28 12:43:15,437 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 96.97/53.37 [2019-03-28 12:43:15,445 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/e1c81277e47b4ac09941c87d0c98b38f/FLAGc40d5c650 96.97/53.37 [2019-03-28 12:43:15,831 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/e1c81277e47b4ac09941c87d0c98b38f 96.97/53.37 [2019-03-28 12:43:15,843 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 96.97/53.37 [2019-03-28 12:43:15,845 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 96.97/53.37 [2019-03-28 12:43:15,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 96.97/53.37 [2019-03-28 12:43:15,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 96.97/53.37 [2019-03-28 12:43:15,850 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 96.97/53.37 [2019-03-28 12:43:15,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:43:15" (1/1) ... 96.97/53.37 [2019-03-28 12:43:15,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18dbde5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:15, skipping insertion in model container 96.97/53.37 [2019-03-28 12:43:15,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:43:15" (1/1) ... 96.97/53.37 [2019-03-28 12:43:15,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 96.97/53.37 [2019-03-28 12:43:15,882 INFO L176 MainTranslator]: Built tables and reachable declarations 96.97/53.37 [2019-03-28 12:43:16,057 INFO L206 PostProcessor]: Analyzing one entry point: main 96.97/53.37 [2019-03-28 12:43:16,070 INFO L191 MainTranslator]: Completed pre-run 96.97/53.37 [2019-03-28 12:43:16,094 INFO L206 PostProcessor]: Analyzing one entry point: main 96.97/53.37 [2019-03-28 12:43:16,168 INFO L195 MainTranslator]: Completed translation 96.97/53.37 [2019-03-28 12:43:16,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:16 WrapperNode 96.97/53.37 [2019-03-28 12:43:16,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 96.97/53.37 [2019-03-28 12:43:16,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 96.97/53.37 [2019-03-28 12:43:16,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 96.97/53.37 [2019-03-28 12:43:16,170 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 96.97/53.37 [2019-03-28 12:43:16,180 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:43:16" (1/1) ... 96.97/53.37 [2019-03-28 12:43:16,190 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:43:16" (1/1) ... 96.97/53.37 [2019-03-28 12:43:16,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 96.97/53.37 [2019-03-28 12:43:16,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 96.97/53.37 [2019-03-28 12:43:16,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 96.97/53.37 [2019-03-28 12:43:16,217 INFO L276 PluginConnector]: Boogie Preprocessor initialized 96.97/53.37 [2019-03-28 12:43:16,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:16" (1/1) ... 96.97/53.37 [2019-03-28 12:43:16,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:16" (1/1) ... 96.97/53.37 [2019-03-28 12:43:16,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:16" (1/1) ... 96.97/53.37 [2019-03-28 12:43:16,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:16" (1/1) ... 96.97/53.37 [2019-03-28 12:43:16,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:16" (1/1) ... 96.97/53.37 [2019-03-28 12:43:16,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:16" (1/1) ... 96.97/53.37 [2019-03-28 12:43:16,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:16" (1/1) ... 96.97/53.37 [2019-03-28 12:43:16,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 96.97/53.37 [2019-03-28 12:43:16,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 96.97/53.37 [2019-03-28 12:43:16,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... 96.97/53.37 [2019-03-28 12:43:16,247 INFO L276 PluginConnector]: RCFGBuilder initialized 96.97/53.37 [2019-03-28 12:43:16,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:16" (1/1) ... 96.97/53.37 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 96.97/53.37 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 96.97/53.37 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 96.97/53.37 [2019-03-28 12:43:16,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 96.97/53.37 [2019-03-28 12:43:16,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 96.97/53.37 [2019-03-28 12:43:16,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 96.97/53.37 [2019-03-28 12:43:16,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 96.97/53.37 [2019-03-28 12:43:16,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 96.97/53.37 [2019-03-28 12:43:16,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 96.97/53.37 [2019-03-28 12:43:16,647 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 96.97/53.37 [2019-03-28 12:43:16,648 INFO L286 CfgBuilder]: Removed 10 assue(true) statements. 96.97/53.37 [2019-03-28 12:43:16,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:43:16 BoogieIcfgContainer 96.97/53.37 [2019-03-28 12:43:16,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 96.97/53.37 [2019-03-28 12:43:16,650 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 96.97/53.37 [2019-03-28 12:43:16,650 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 96.97/53.37 [2019-03-28 12:43:16,652 INFO L276 PluginConnector]: BlockEncodingV2 initialized 96.97/53.37 [2019-03-28 12:43:16,653 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:43:16" (1/1) ... 96.97/53.37 [2019-03-28 12:43:16,672 INFO L313 BlockEncoder]: Initial Icfg 59 locations, 70 edges 96.97/53.37 [2019-03-28 12:43:16,673 INFO L258 BlockEncoder]: Using Remove infeasible edges 96.97/53.37 [2019-03-28 12:43:16,674 INFO L263 BlockEncoder]: Using Maximize final states 96.97/53.37 [2019-03-28 12:43:16,674 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 96.97/53.37 [2019-03-28 12:43:16,675 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 96.97/53.37 [2019-03-28 12:43:16,677 INFO L296 BlockEncoder]: Using Remove sink states 96.97/53.37 [2019-03-28 12:43:16,678 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 96.97/53.37 [2019-03-28 12:43:16,678 INFO L179 BlockEncoder]: Using Rewrite not-equals 96.97/53.37 [2019-03-28 12:43:16,704 INFO L185 BlockEncoder]: Using Use SBE 96.97/53.37 [2019-03-28 12:43:16,742 INFO L200 BlockEncoder]: SBE split 25 edges 96.97/53.37 [2019-03-28 12:43:16,748 INFO L70 emoveInfeasibleEdges]: Removed 4 edges and 0 locations because of local infeasibility 96.97/53.37 [2019-03-28 12:43:16,750 INFO L71 MaximizeFinalStates]: 0 new accepting states 96.97/53.37 [2019-03-28 12:43:16,811 INFO L100 BaseMinimizeStates]: Removed 22 edges and 11 locations by large block encoding 96.97/53.37 [2019-03-28 12:43:16,814 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 96.97/53.37 [2019-03-28 12:43:16,815 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 96.97/53.37 [2019-03-28 12:43:16,816 INFO L71 MaximizeFinalStates]: 0 new accepting states 96.97/53.37 [2019-03-28 12:43:16,816 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 96.97/53.37 [2019-03-28 12:43:16,817 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 96.97/53.37 [2019-03-28 12:43:16,817 INFO L313 BlockEncoder]: Encoded RCFG 47 locations, 85 edges 96.97/53.37 [2019-03-28 12:43:16,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:43:16 BasicIcfg 96.97/53.37 [2019-03-28 12:43:16,818 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 96.97/53.37 [2019-03-28 12:43:16,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 96.97/53.37 [2019-03-28 12:43:16,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... 96.97/53.37 [2019-03-28 12:43:16,822 INFO L276 PluginConnector]: TraceAbstraction initialized 96.97/53.37 [2019-03-28 12:43:16,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:43:15" (1/4) ... 96.97/53.37 [2019-03-28 12:43:16,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2306cb6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:43:16, skipping insertion in model container 96.97/53.37 [2019-03-28 12:43:16,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:16" (2/4) ... 96.97/53.37 [2019-03-28 12:43:16,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2306cb6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:43:16, skipping insertion in model container 96.97/53.37 [2019-03-28 12:43:16,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:43:16" (3/4) ... 96.97/53.37 [2019-03-28 12:43:16,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2306cb6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:43:16, skipping insertion in model container 96.97/53.37 [2019-03-28 12:43:16,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:43:16" (4/4) ... 96.97/53.37 [2019-03-28 12:43:16,826 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 96.97/53.37 [2019-03-28 12:43:16,836 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 96.97/53.37 [2019-03-28 12:43:16,845 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. 96.97/53.37 [2019-03-28 12:43:16,862 INFO L257 AbstractCegarLoop]: Starting to check reachability of 22 error locations. 96.97/53.37 [2019-03-28 12:43:16,891 INFO L133 ementStrategyFactory]: Using default assertion order modulation 96.97/53.37 [2019-03-28 12:43:16,892 INFO L382 AbstractCegarLoop]: Interprodecural is true 96.97/53.37 [2019-03-28 12:43:16,892 INFO L383 AbstractCegarLoop]: Hoare is true 96.97/53.37 [2019-03-28 12:43:16,892 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 96.97/53.37 [2019-03-28 12:43:16,892 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 96.97/53.37 [2019-03-28 12:43:16,892 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 96.97/53.37 [2019-03-28 12:43:16,893 INFO L387 AbstractCegarLoop]: Difference is false 96.97/53.37 [2019-03-28 12:43:16,893 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 96.97/53.37 [2019-03-28 12:43:16,893 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 96.97/53.37 [2019-03-28 12:43:16,909 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. 96.97/53.37 [2019-03-28 12:43:16,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 96.97/53.37 [2019-03-28 12:43:16,916 INFO L394 BasicCegarLoop]: Found error trace 96.97/53.37 [2019-03-28 12:43:16,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 96.97/53.37 [2019-03-28 12:43:16,917 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 96.97/53.37 [2019-03-28 12:43:16,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.37 [2019-03-28 12:43:16,923 INFO L82 PathProgramCache]: Analyzing trace with hash 292231062, now seen corresponding path program 1 times 96.97/53.37 [2019-03-28 12:43:16,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.37 [2019-03-28 12:43:16,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.37 [2019-03-28 12:43:16,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:16,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:16,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.37 [2019-03-28 12:43:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 96.97/53.37 [2019-03-28 12:43:17,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 96.97/53.37 [2019-03-28 12:43:17,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 96.97/53.37 [2019-03-28 12:43:17,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 96.97/53.37 [2019-03-28 12:43:17,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 96.97/53.37 [2019-03-28 12:43:17,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 96.97/53.37 [2019-03-28 12:43:17,145 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. 96.97/53.37 [2019-03-28 12:43:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 96.97/53.37 [2019-03-28 12:43:17,334 INFO L93 Difference]: Finished difference Result 47 states and 85 transitions. 96.97/53.37 [2019-03-28 12:43:17,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 96.97/53.37 [2019-03-28 12:43:17,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 96.97/53.37 [2019-03-28 12:43:17,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 96.97/53.37 [2019-03-28 12:43:17,350 INFO L225 Difference]: With dead ends: 47 96.97/53.37 [2019-03-28 12:43:17,350 INFO L226 Difference]: Without dead ends: 40 96.97/53.37 [2019-03-28 12:43:17,354 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 96.97/53.37 [2019-03-28 12:43:17,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. 96.97/53.37 [2019-03-28 12:43:17,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. 96.97/53.37 [2019-03-28 12:43:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. 96.97/53.37 [2019-03-28 12:43:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 71 transitions. 96.97/53.37 [2019-03-28 12:43:17,395 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 71 transitions. Word has length 5 96.97/53.37 [2019-03-28 12:43:17,396 INFO L84 Accepts]: Finished accepts. word is rejected. 96.97/53.37 [2019-03-28 12:43:17,396 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 71 transitions. 96.97/53.37 [2019-03-28 12:43:17,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 96.97/53.37 [2019-03-28 12:43:17,396 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 71 transitions. 96.97/53.37 [2019-03-28 12:43:17,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 96.97/53.37 [2019-03-28 12:43:17,397 INFO L394 BasicCegarLoop]: Found error trace 96.97/53.37 [2019-03-28 12:43:17,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 96.97/53.37 [2019-03-28 12:43:17,397 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 96.97/53.37 [2019-03-28 12:43:17,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.37 [2019-03-28 12:43:17,398 INFO L82 PathProgramCache]: Analyzing trace with hash 292231064, now seen corresponding path program 1 times 96.97/53.37 [2019-03-28 12:43:17,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.37 [2019-03-28 12:43:17,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.37 [2019-03-28 12:43:17,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:17,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:17,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.37 [2019-03-28 12:43:17,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 96.97/53.37 [2019-03-28 12:43:17,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 96.97/53.37 [2019-03-28 12:43:17,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 96.97/53.37 [2019-03-28 12:43:17,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 96.97/53.37 [2019-03-28 12:43:17,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 96.97/53.37 [2019-03-28 12:43:17,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 96.97/53.37 [2019-03-28 12:43:17,461 INFO L87 Difference]: Start difference. First operand 40 states and 71 transitions. Second operand 4 states. 96.97/53.37 [2019-03-28 12:43:17,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 96.97/53.37 [2019-03-28 12:43:17,635 INFO L93 Difference]: Finished difference Result 45 states and 71 transitions. 96.97/53.37 [2019-03-28 12:43:17,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 96.97/53.37 [2019-03-28 12:43:17,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 96.97/53.37 [2019-03-28 12:43:17,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 96.97/53.37 [2019-03-28 12:43:17,636 INFO L225 Difference]: With dead ends: 45 96.97/53.37 [2019-03-28 12:43:17,637 INFO L226 Difference]: Without dead ends: 40 96.97/53.37 [2019-03-28 12:43:17,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 96.97/53.37 [2019-03-28 12:43:17,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. 96.97/53.37 [2019-03-28 12:43:17,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. 96.97/53.37 [2019-03-28 12:43:17,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. 96.97/53.37 [2019-03-28 12:43:17,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 66 transitions. 96.97/53.37 [2019-03-28 12:43:17,644 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 66 transitions. Word has length 5 96.97/53.37 [2019-03-28 12:43:17,644 INFO L84 Accepts]: Finished accepts. word is rejected. 96.97/53.37 [2019-03-28 12:43:17,644 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 66 transitions. 96.97/53.37 [2019-03-28 12:43:17,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 96.97/53.37 [2019-03-28 12:43:17,645 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 66 transitions. 96.97/53.37 [2019-03-28 12:43:17,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 96.97/53.37 [2019-03-28 12:43:17,645 INFO L394 BasicCegarLoop]: Found error trace 96.97/53.37 [2019-03-28 12:43:17,645 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 96.97/53.37 [2019-03-28 12:43:17,645 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 96.97/53.37 [2019-03-28 12:43:17,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.37 [2019-03-28 12:43:17,646 INFO L82 PathProgramCache]: Analyzing trace with hash 292231065, now seen corresponding path program 1 times 96.97/53.37 [2019-03-28 12:43:17,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.37 [2019-03-28 12:43:17,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.37 [2019-03-28 12:43:17,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:17,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:17,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.37 [2019-03-28 12:43:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 96.97/53.37 [2019-03-28 12:43:17,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 96.97/53.37 [2019-03-28 12:43:17,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 96.97/53.37 [2019-03-28 12:43:17,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 96.97/53.37 [2019-03-28 12:43:17,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 96.97/53.37 [2019-03-28 12:43:17,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 96.97/53.37 [2019-03-28 12:43:17,682 INFO L87 Difference]: Start difference. First operand 40 states and 66 transitions. Second operand 3 states. 96.97/53.37 [2019-03-28 12:43:17,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 96.97/53.37 [2019-03-28 12:43:17,830 INFO L93 Difference]: Finished difference Result 46 states and 75 transitions. 96.97/53.37 [2019-03-28 12:43:17,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 96.97/53.37 [2019-03-28 12:43:17,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 96.97/53.37 [2019-03-28 12:43:17,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 96.97/53.37 [2019-03-28 12:43:17,831 INFO L225 Difference]: With dead ends: 46 96.97/53.37 [2019-03-28 12:43:17,831 INFO L226 Difference]: Without dead ends: 45 96.97/53.37 [2019-03-28 12:43:17,832 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 96.97/53.37 [2019-03-28 12:43:17,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. 96.97/53.37 [2019-03-28 12:43:17,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. 96.97/53.37 [2019-03-28 12:43:17,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 96.97/53.37 [2019-03-28 12:43:17,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 69 transitions. 96.97/53.37 [2019-03-28 12:43:17,840 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 69 transitions. Word has length 5 96.97/53.37 [2019-03-28 12:43:17,840 INFO L84 Accepts]: Finished accepts. word is rejected. 96.97/53.37 [2019-03-28 12:43:17,840 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 69 transitions. 96.97/53.37 [2019-03-28 12:43:17,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 96.97/53.37 [2019-03-28 12:43:17,841 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 69 transitions. 96.97/53.37 [2019-03-28 12:43:17,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 96.97/53.37 [2019-03-28 12:43:17,841 INFO L394 BasicCegarLoop]: Found error trace 96.97/53.37 [2019-03-28 12:43:17,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 96.97/53.37 [2019-03-28 12:43:17,841 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 96.97/53.37 [2019-03-28 12:43:17,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.37 [2019-03-28 12:43:17,842 INFO L82 PathProgramCache]: Analyzing trace with hash 469225651, now seen corresponding path program 1 times 96.97/53.37 [2019-03-28 12:43:17,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.37 [2019-03-28 12:43:17,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.37 [2019-03-28 12:43:17,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:17,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:17,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.37 [2019-03-28 12:43:17,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 96.97/53.37 [2019-03-28 12:43:17,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 96.97/53.37 [2019-03-28 12:43:17,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 96.97/53.37 [2019-03-28 12:43:17,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 96.97/53.37 [2019-03-28 12:43:17,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 96.97/53.37 [2019-03-28 12:43:17,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 96.97/53.37 [2019-03-28 12:43:17,880 INFO L87 Difference]: Start difference. First operand 42 states and 69 transitions. Second operand 3 states. 96.97/53.37 [2019-03-28 12:43:17,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 96.97/53.37 [2019-03-28 12:43:17,985 INFO L93 Difference]: Finished difference Result 42 states and 69 transitions. 96.97/53.37 [2019-03-28 12:43:17,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 96.97/53.37 [2019-03-28 12:43:17,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 96.97/53.37 [2019-03-28 12:43:17,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 96.97/53.37 [2019-03-28 12:43:17,987 INFO L225 Difference]: With dead ends: 42 96.97/53.37 [2019-03-28 12:43:17,987 INFO L226 Difference]: Without dead ends: 40 96.97/53.37 [2019-03-28 12:43:17,987 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 96.97/53.37 [2019-03-28 12:43:17,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. 96.97/53.37 [2019-03-28 12:43:17,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. 96.97/53.37 [2019-03-28 12:43:17,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. 96.97/53.37 [2019-03-28 12:43:17,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. 96.97/53.37 [2019-03-28 12:43:17,994 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 6 96.97/53.37 [2019-03-28 12:43:17,994 INFO L84 Accepts]: Finished accepts. word is rejected. 96.97/53.37 [2019-03-28 12:43:17,994 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. 96.97/53.37 [2019-03-28 12:43:17,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 96.97/53.37 [2019-03-28 12:43:17,994 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. 96.97/53.37 [2019-03-28 12:43:17,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 96.97/53.37 [2019-03-28 12:43:17,995 INFO L394 BasicCegarLoop]: Found error trace 96.97/53.37 [2019-03-28 12:43:17,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 96.97/53.37 [2019-03-28 12:43:17,995 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 96.97/53.37 [2019-03-28 12:43:17,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.37 [2019-03-28 12:43:17,996 INFO L82 PathProgramCache]: Analyzing trace with hash 469225653, now seen corresponding path program 1 times 96.97/53.37 [2019-03-28 12:43:17,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.37 [2019-03-28 12:43:17,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.37 [2019-03-28 12:43:17,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:17,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:17,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.37 [2019-03-28 12:43:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 96.97/53.37 [2019-03-28 12:43:18,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 96.97/53.37 [2019-03-28 12:43:18,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 96.97/53.37 [2019-03-28 12:43:18,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 96.97/53.37 [2019-03-28 12:43:18,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 96.97/53.37 [2019-03-28 12:43:18,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 96.97/53.37 [2019-03-28 12:43:18,045 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 4 states. 96.97/53.37 [2019-03-28 12:43:18,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 96.97/53.37 [2019-03-28 12:43:18,166 INFO L93 Difference]: Finished difference Result 42 states and 65 transitions. 96.97/53.37 [2019-03-28 12:43:18,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 96.97/53.37 [2019-03-28 12:43:18,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 96.97/53.37 [2019-03-28 12:43:18,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 96.97/53.37 [2019-03-28 12:43:18,167 INFO L225 Difference]: With dead ends: 42 96.97/53.37 [2019-03-28 12:43:18,167 INFO L226 Difference]: Without dead ends: 40 96.97/53.37 [2019-03-28 12:43:18,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 96.97/53.37 [2019-03-28 12:43:18,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. 96.97/53.37 [2019-03-28 12:43:18,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. 96.97/53.37 [2019-03-28 12:43:18,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. 96.97/53.37 [2019-03-28 12:43:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 63 transitions. 96.97/53.37 [2019-03-28 12:43:18,173 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 63 transitions. Word has length 6 96.97/53.37 [2019-03-28 12:43:18,174 INFO L84 Accepts]: Finished accepts. word is rejected. 96.97/53.37 [2019-03-28 12:43:18,174 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 63 transitions. 96.97/53.37 [2019-03-28 12:43:18,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 96.97/53.37 [2019-03-28 12:43:18,174 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 63 transitions. 96.97/53.37 [2019-03-28 12:43:18,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 96.97/53.37 [2019-03-28 12:43:18,174 INFO L394 BasicCegarLoop]: Found error trace 96.97/53.37 [2019-03-28 12:43:18,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 96.97/53.37 [2019-03-28 12:43:18,175 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 96.97/53.37 [2019-03-28 12:43:18,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.37 [2019-03-28 12:43:18,176 INFO L82 PathProgramCache]: Analyzing trace with hash 469225654, now seen corresponding path program 1 times 96.97/53.37 [2019-03-28 12:43:18,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.37 [2019-03-28 12:43:18,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.37 [2019-03-28 12:43:18,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:18,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:18,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.37 [2019-03-28 12:43:18,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 96.97/53.37 [2019-03-28 12:43:18,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 96.97/53.37 [2019-03-28 12:43:18,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 96.97/53.37 [2019-03-28 12:43:18,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 96.97/53.37 [2019-03-28 12:43:18,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 96.97/53.37 [2019-03-28 12:43:18,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 96.97/53.37 [2019-03-28 12:43:18,221 INFO L87 Difference]: Start difference. First operand 40 states and 63 transitions. Second operand 4 states. 96.97/53.37 [2019-03-28 12:43:18,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 96.97/53.37 [2019-03-28 12:43:18,321 INFO L93 Difference]: Finished difference Result 40 states and 63 transitions. 96.97/53.37 [2019-03-28 12:43:18,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 96.97/53.37 [2019-03-28 12:43:18,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 96.97/53.37 [2019-03-28 12:43:18,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 96.97/53.37 [2019-03-28 12:43:18,323 INFO L225 Difference]: With dead ends: 40 96.97/53.37 [2019-03-28 12:43:18,323 INFO L226 Difference]: Without dead ends: 28 96.97/53.37 [2019-03-28 12:43:18,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 96.97/53.37 [2019-03-28 12:43:18,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 96.97/53.37 [2019-03-28 12:43:18,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. 96.97/53.37 [2019-03-28 12:43:18,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 96.97/53.37 [2019-03-28 12:43:18,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 46 transitions. 96.97/53.37 [2019-03-28 12:43:18,327 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 46 transitions. Word has length 6 96.97/53.37 [2019-03-28 12:43:18,327 INFO L84 Accepts]: Finished accepts. word is rejected. 96.97/53.37 [2019-03-28 12:43:18,328 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 46 transitions. 96.97/53.37 [2019-03-28 12:43:18,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 96.97/53.37 [2019-03-28 12:43:18,328 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 46 transitions. 96.97/53.37 [2019-03-28 12:43:18,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 96.97/53.37 [2019-03-28 12:43:18,328 INFO L394 BasicCegarLoop]: Found error trace 96.97/53.37 [2019-03-28 12:43:18,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 96.97/53.37 [2019-03-28 12:43:18,329 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 96.97/53.37 [2019-03-28 12:43:18,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.37 [2019-03-28 12:43:18,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1665461681, now seen corresponding path program 1 times 96.97/53.37 [2019-03-28 12:43:18,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.37 [2019-03-28 12:43:18,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.37 [2019-03-28 12:43:18,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:18,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:18,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.37 [2019-03-28 12:43:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 96.97/53.37 [2019-03-28 12:43:18,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 96.97/53.37 [2019-03-28 12:43:18,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 96.97/53.37 [2019-03-28 12:43:18,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 96.97/53.37 [2019-03-28 12:43:18,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 96.97/53.37 [2019-03-28 12:43:18,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 96.97/53.37 [2019-03-28 12:43:18,361 INFO L87 Difference]: Start difference. First operand 26 states and 46 transitions. Second operand 4 states. 96.97/53.37 [2019-03-28 12:43:18,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 96.97/53.37 [2019-03-28 12:43:18,453 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. 96.97/53.37 [2019-03-28 12:43:18,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 96.97/53.37 [2019-03-28 12:43:18,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 96.97/53.37 [2019-03-28 12:43:18,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 96.97/53.37 [2019-03-28 12:43:18,454 INFO L225 Difference]: With dead ends: 49 96.97/53.37 [2019-03-28 12:43:18,454 INFO L226 Difference]: Without dead ends: 29 96.97/53.37 [2019-03-28 12:43:18,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 96.97/53.37 [2019-03-28 12:43:18,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 96.97/53.37 [2019-03-28 12:43:18,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. 96.97/53.37 [2019-03-28 12:43:18,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 96.97/53.37 [2019-03-28 12:43:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 47 transitions. 96.97/53.37 [2019-03-28 12:43:18,460 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 47 transitions. Word has length 7 96.97/53.37 [2019-03-28 12:43:18,460 INFO L84 Accepts]: Finished accepts. word is rejected. 96.97/53.37 [2019-03-28 12:43:18,460 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 47 transitions. 96.97/53.37 [2019-03-28 12:43:18,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 96.97/53.37 [2019-03-28 12:43:18,460 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 47 transitions. 96.97/53.37 [2019-03-28 12:43:18,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 96.97/53.37 [2019-03-28 12:43:18,461 INFO L394 BasicCegarLoop]: Found error trace 96.97/53.37 [2019-03-28 12:43:18,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 96.97/53.37 [2019-03-28 12:43:18,461 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 96.97/53.37 [2019-03-28 12:43:18,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.37 [2019-03-28 12:43:18,461 INFO L82 PathProgramCache]: Analyzing trace with hash -931881668, now seen corresponding path program 1 times 96.97/53.37 [2019-03-28 12:43:18,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.37 [2019-03-28 12:43:18,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.37 [2019-03-28 12:43:18,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:18,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:18,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.37 [2019-03-28 12:43:18,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 96.97/53.37 [2019-03-28 12:43:18,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 96.97/53.37 [2019-03-28 12:43:18,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 96.97/53.37 [2019-03-28 12:43:18,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 96.97/53.37 [2019-03-28 12:43:18,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 96.97/53.37 [2019-03-28 12:43:18,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 96.97/53.37 [2019-03-28 12:43:18,566 INFO L87 Difference]: Start difference. First operand 27 states and 47 transitions. Second operand 5 states. 96.97/53.37 [2019-03-28 12:43:18,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 96.97/53.37 [2019-03-28 12:43:18,646 INFO L93 Difference]: Finished difference Result 27 states and 47 transitions. 96.97/53.37 [2019-03-28 12:43:18,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 96.97/53.37 [2019-03-28 12:43:18,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 96.97/53.37 [2019-03-28 12:43:18,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 96.97/53.37 [2019-03-28 12:43:18,648 INFO L225 Difference]: With dead ends: 27 96.97/53.37 [2019-03-28 12:43:18,648 INFO L226 Difference]: Without dead ends: 25 96.97/53.37 [2019-03-28 12:43:18,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 96.97/53.37 [2019-03-28 12:43:18,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 96.97/53.37 [2019-03-28 12:43:18,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. 96.97/53.37 [2019-03-28 12:43:18,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 96.97/53.37 [2019-03-28 12:43:18,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 43 transitions. 96.97/53.37 [2019-03-28 12:43:18,653 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 43 transitions. Word has length 10 96.97/53.37 [2019-03-28 12:43:18,653 INFO L84 Accepts]: Finished accepts. word is rejected. 96.97/53.37 [2019-03-28 12:43:18,653 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 43 transitions. 96.97/53.37 [2019-03-28 12:43:18,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 96.97/53.37 [2019-03-28 12:43:18,654 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 43 transitions. 96.97/53.37 [2019-03-28 12:43:18,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 96.97/53.37 [2019-03-28 12:43:18,654 INFO L394 BasicCegarLoop]: Found error trace 96.97/53.37 [2019-03-28 12:43:18,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 96.97/53.37 [2019-03-28 12:43:18,655 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 96.97/53.37 [2019-03-28 12:43:18,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.37 [2019-03-28 12:43:18,655 INFO L82 PathProgramCache]: Analyzing trace with hash -931881667, now seen corresponding path program 1 times 96.97/53.37 [2019-03-28 12:43:18,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.37 [2019-03-28 12:43:18,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.37 [2019-03-28 12:43:18,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:18,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:18,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.37 [2019-03-28 12:43:18,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 96.97/53.37 [2019-03-28 12:43:18,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 96.97/53.37 [2019-03-28 12:43:18,729 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 96.97/53.37 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 96.97/53.37 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 96.97/53.37 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 96.97/53.37 [2019-03-28 12:43:18,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.37 [2019-03-28 12:43:18,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core 96.97/53.37 [2019-03-28 12:43:18,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.37 [2019-03-28 12:43:18,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 96.97/53.37 [2019-03-28 12:43:18,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 96.97/53.37 [2019-03-28 12:43:18,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 96.97/53.37 [2019-03-28 12:43:18,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 96.97/53.37 [2019-03-28 12:43:18,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 96.97/53.37 [2019-03-28 12:43:18,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 96.97/53.37 [2019-03-28 12:43:18,839 INFO L87 Difference]: Start difference. First operand 25 states and 43 transitions. Second operand 8 states. 96.97/53.37 [2019-03-28 12:43:18,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 96.97/53.37 [2019-03-28 12:43:18,998 INFO L93 Difference]: Finished difference Result 67 states and 104 transitions. 96.97/53.37 [2019-03-28 12:43:18,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 96.97/53.37 [2019-03-28 12:43:18,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 96.97/53.37 [2019-03-28 12:43:18,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 96.97/53.37 [2019-03-28 12:43:19,000 INFO L225 Difference]: With dead ends: 67 96.97/53.37 [2019-03-28 12:43:19,000 INFO L226 Difference]: Without dead ends: 48 96.97/53.37 [2019-03-28 12:43:19,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 96.97/53.37 [2019-03-28 12:43:19,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. 96.97/53.37 [2019-03-28 12:43:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 28. 96.97/53.37 [2019-03-28 12:43:19,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 96.97/53.37 [2019-03-28 12:43:19,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 46 transitions. 96.97/53.37 [2019-03-28 12:43:19,005 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 46 transitions. Word has length 10 96.97/53.37 [2019-03-28 12:43:19,005 INFO L84 Accepts]: Finished accepts. word is rejected. 96.97/53.37 [2019-03-28 12:43:19,006 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 46 transitions. 96.97/53.37 [2019-03-28 12:43:19,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 96.97/53.37 [2019-03-28 12:43:19,006 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 46 transitions. 96.97/53.37 [2019-03-28 12:43:19,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 96.97/53.37 [2019-03-28 12:43:19,006 INFO L394 BasicCegarLoop]: Found error trace 96.97/53.37 [2019-03-28 12:43:19,007 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] 96.97/53.37 [2019-03-28 12:43:19,007 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 96.97/53.37 [2019-03-28 12:43:19,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.37 [2019-03-28 12:43:19,007 INFO L82 PathProgramCache]: Analyzing trace with hash -256786990, now seen corresponding path program 2 times 96.97/53.37 [2019-03-28 12:43:19,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.37 [2019-03-28 12:43:19,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.37 [2019-03-28 12:43:19,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:19,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:19,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.37 [2019-03-28 12:43:19,082 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. 96.97/53.37 [2019-03-28 12:43:19,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 96.97/53.37 [2019-03-28 12:43:19,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 96.97/53.37 [2019-03-28 12:43:19,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 96.97/53.37 [2019-03-28 12:43:19,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 96.97/53.37 [2019-03-28 12:43:19,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 96.97/53.37 [2019-03-28 12:43:19,083 INFO L87 Difference]: Start difference. First operand 28 states and 46 transitions. Second operand 4 states. 96.97/53.37 [2019-03-28 12:43:19,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 96.97/53.37 [2019-03-28 12:43:19,166 INFO L93 Difference]: Finished difference Result 29 states and 46 transitions. 96.97/53.37 [2019-03-28 12:43:19,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 96.97/53.37 [2019-03-28 12:43:19,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 96.97/53.37 [2019-03-28 12:43:19,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 96.97/53.37 [2019-03-28 12:43:19,180 INFO L225 Difference]: With dead ends: 29 96.97/53.37 [2019-03-28 12:43:19,180 INFO L226 Difference]: Without dead ends: 28 96.97/53.37 [2019-03-28 12:43:19,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 96.97/53.37 [2019-03-28 12:43:19,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 96.97/53.37 [2019-03-28 12:43:19,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 96.97/53.37 [2019-03-28 12:43:19,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 96.97/53.37 [2019-03-28 12:43:19,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. 96.97/53.37 [2019-03-28 12:43:19,185 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 45 transitions. Word has length 13 96.97/53.37 [2019-03-28 12:43:19,185 INFO L84 Accepts]: Finished accepts. word is rejected. 96.97/53.37 [2019-03-28 12:43:19,185 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 45 transitions. 96.97/53.37 [2019-03-28 12:43:19,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 96.97/53.37 [2019-03-28 12:43:19,185 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. 96.97/53.37 [2019-03-28 12:43:19,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 96.97/53.37 [2019-03-28 12:43:19,186 INFO L394 BasicCegarLoop]: Found error trace 96.97/53.37 [2019-03-28 12:43:19,186 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] 96.97/53.37 [2019-03-28 12:43:19,186 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 96.97/53.37 [2019-03-28 12:43:19,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.37 [2019-03-28 12:43:19,187 INFO L82 PathProgramCache]: Analyzing trace with hash -256786989, now seen corresponding path program 1 times 96.97/53.37 [2019-03-28 12:43:19,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.37 [2019-03-28 12:43:19,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.37 [2019-03-28 12:43:19,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:19,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:19,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.37 [2019-03-28 12:43:19,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. 96.97/53.37 [2019-03-28 12:43:19,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 96.97/53.37 [2019-03-28 12:43:19,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 96.97/53.37 [2019-03-28 12:43:19,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 96.97/53.37 [2019-03-28 12:43:19,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 96.97/53.37 [2019-03-28 12:43:19,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 96.97/53.37 [2019-03-28 12:43:19,228 INFO L87 Difference]: Start difference. First operand 28 states and 45 transitions. Second operand 4 states. 96.97/53.37 [2019-03-28 12:43:19,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 96.97/53.37 [2019-03-28 12:43:19,319 INFO L93 Difference]: Finished difference Result 46 states and 71 transitions. 96.97/53.37 [2019-03-28 12:43:19,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 96.97/53.37 [2019-03-28 12:43:19,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 96.97/53.37 [2019-03-28 12:43:19,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 96.97/53.37 [2019-03-28 12:43:19,320 INFO L225 Difference]: With dead ends: 46 96.97/53.37 [2019-03-28 12:43:19,320 INFO L226 Difference]: Without dead ends: 45 96.97/53.37 [2019-03-28 12:43:19,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 96.97/53.37 [2019-03-28 12:43:19,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. 96.97/53.37 [2019-03-28 12:43:19,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. 96.97/53.37 [2019-03-28 12:43:19,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 96.97/53.37 [2019-03-28 12:43:19,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 70 transitions. 96.97/53.37 [2019-03-28 12:43:19,327 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 70 transitions. Word has length 13 96.97/53.37 [2019-03-28 12:43:19,327 INFO L84 Accepts]: Finished accepts. word is rejected. 96.97/53.37 [2019-03-28 12:43:19,327 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 70 transitions. 96.97/53.37 [2019-03-28 12:43:19,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 96.97/53.37 [2019-03-28 12:43:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 70 transitions. 96.97/53.37 [2019-03-28 12:43:19,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 96.97/53.37 [2019-03-28 12:43:19,328 INFO L394 BasicCegarLoop]: Found error trace 96.97/53.37 [2019-03-28 12:43:19,328 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 96.97/53.37 [2019-03-28 12:43:19,328 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 96.97/53.37 [2019-03-28 12:43:19,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.37 [2019-03-28 12:43:19,329 INFO L82 PathProgramCache]: Analyzing trace with hash 629535330, now seen corresponding path program 1 times 96.97/53.37 [2019-03-28 12:43:19,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.37 [2019-03-28 12:43:19,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.37 [2019-03-28 12:43:19,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:19,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:19,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.37 [2019-03-28 12:43:19,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. 96.97/53.37 [2019-03-28 12:43:19,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 96.97/53.37 [2019-03-28 12:43:19,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 96.97/53.37 [2019-03-28 12:43:19,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 96.97/53.37 [2019-03-28 12:43:19,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 96.97/53.37 [2019-03-28 12:43:19,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 96.97/53.37 [2019-03-28 12:43:19,370 INFO L87 Difference]: Start difference. First operand 42 states and 70 transitions. Second operand 4 states. 96.97/53.37 [2019-03-28 12:43:19,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 96.97/53.37 [2019-03-28 12:43:19,451 INFO L93 Difference]: Finished difference Result 74 states and 120 transitions. 96.97/53.37 [2019-03-28 12:43:19,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 96.97/53.37 [2019-03-28 12:43:19,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 96.97/53.37 [2019-03-28 12:43:19,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 96.97/53.37 [2019-03-28 12:43:19,452 INFO L225 Difference]: With dead ends: 74 96.97/53.37 [2019-03-28 12:43:19,453 INFO L226 Difference]: Without dead ends: 73 96.97/53.37 [2019-03-28 12:43:19,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 96.97/53.37 [2019-03-28 12:43:19,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. 96.97/53.37 [2019-03-28 12:43:19,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 48. 96.97/53.37 [2019-03-28 12:43:19,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. 96.97/53.37 [2019-03-28 12:43:19,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. 96.97/53.37 [2019-03-28 12:43:19,460 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 14 96.97/53.37 [2019-03-28 12:43:19,461 INFO L84 Accepts]: Finished accepts. word is rejected. 96.97/53.37 [2019-03-28 12:43:19,461 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. 96.97/53.37 [2019-03-28 12:43:19,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 96.97/53.37 [2019-03-28 12:43:19,461 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. 96.97/53.37 [2019-03-28 12:43:19,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 96.97/53.37 [2019-03-28 12:43:19,462 INFO L394 BasicCegarLoop]: Found error trace 96.97/53.37 [2019-03-28 12:43:19,462 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 96.97/53.37 [2019-03-28 12:43:19,462 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 96.97/53.37 [2019-03-28 12:43:19,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.37 [2019-03-28 12:43:19,462 INFO L82 PathProgramCache]: Analyzing trace with hash 629535331, now seen corresponding path program 1 times 96.97/53.37 [2019-03-28 12:43:19,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.37 [2019-03-28 12:43:19,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.37 [2019-03-28 12:43:19,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:19,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:19,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.37 [2019-03-28 12:43:19,494 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. 96.97/53.37 [2019-03-28 12:43:19,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 96.97/53.37 [2019-03-28 12:43:19,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 96.97/53.37 [2019-03-28 12:43:19,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 96.97/53.37 [2019-03-28 12:43:19,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 96.97/53.37 [2019-03-28 12:43:19,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 96.97/53.37 [2019-03-28 12:43:19,496 INFO L87 Difference]: Start difference. First operand 48 states and 81 transitions. Second operand 4 states. 96.97/53.37 [2019-03-28 12:43:19,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 96.97/53.37 [2019-03-28 12:43:19,579 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. 96.97/53.37 [2019-03-28 12:43:19,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 96.97/53.37 [2019-03-28 12:43:19,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 96.97/53.37 [2019-03-28 12:43:19,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 96.97/53.37 [2019-03-28 12:43:19,580 INFO L225 Difference]: With dead ends: 49 96.97/53.37 [2019-03-28 12:43:19,580 INFO L226 Difference]: Without dead ends: 48 96.97/53.37 [2019-03-28 12:43:19,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 96.97/53.37 [2019-03-28 12:43:19,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. 96.97/53.37 [2019-03-28 12:43:19,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. 96.97/53.37 [2019-03-28 12:43:19,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. 96.97/53.37 [2019-03-28 12:43:19,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 77 transitions. 96.97/53.37 [2019-03-28 12:43:19,587 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 77 transitions. Word has length 14 96.97/53.37 [2019-03-28 12:43:19,587 INFO L84 Accepts]: Finished accepts. word is rejected. 96.97/53.37 [2019-03-28 12:43:19,587 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 77 transitions. 96.97/53.37 [2019-03-28 12:43:19,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 96.97/53.37 [2019-03-28 12:43:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 77 transitions. 96.97/53.37 [2019-03-28 12:43:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 96.97/53.37 [2019-03-28 12:43:19,588 INFO L394 BasicCegarLoop]: Found error trace 96.97/53.37 [2019-03-28 12:43:19,588 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] 96.97/53.37 [2019-03-28 12:43:19,588 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 96.97/53.37 [2019-03-28 12:43:19,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.37 [2019-03-28 12:43:19,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1954468713, now seen corresponding path program 1 times 96.97/53.37 [2019-03-28 12:43:19,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.37 [2019-03-28 12:43:19,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.37 [2019-03-28 12:43:19,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:19,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:19,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.37 [2019-03-28 12:43:19,639 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. 96.97/53.37 [2019-03-28 12:43:19,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 96.97/53.37 [2019-03-28 12:43:19,640 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 96.97/53.37 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 96.97/53.37 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 96.97/53.37 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 96.97/53.37 [2019-03-28 12:43:19,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.37 [2019-03-28 12:43:19,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core 96.97/53.37 [2019-03-28 12:43:19,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.37 [2019-03-28 12:43:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. 96.97/53.37 [2019-03-28 12:43:19,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 96.97/53.37 [2019-03-28 12:43:19,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 96.97/53.37 [2019-03-28 12:43:19,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 96.97/53.37 [2019-03-28 12:43:19,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 96.97/53.37 [2019-03-28 12:43:19,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 96.97/53.37 [2019-03-28 12:43:19,739 INFO L87 Difference]: Start difference. First operand 48 states and 77 transitions. Second operand 7 states. 96.97/53.37 [2019-03-28 12:43:19,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 96.97/53.37 [2019-03-28 12:43:19,957 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions. 96.97/53.37 [2019-03-28 12:43:19,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 96.97/53.37 [2019-03-28 12:43:19,958 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 96.97/53.37 [2019-03-28 12:43:19,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 96.97/53.37 [2019-03-28 12:43:19,959 INFO L225 Difference]: With dead ends: 83 96.97/53.37 [2019-03-28 12:43:19,959 INFO L226 Difference]: Without dead ends: 62 96.97/53.37 [2019-03-28 12:43:19,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 96.97/53.37 [2019-03-28 12:43:19,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. 96.97/53.37 [2019-03-28 12:43:19,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 30. 96.97/53.37 [2019-03-28 12:43:19,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 96.97/53.37 [2019-03-28 12:43:19,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 46 transitions. 96.97/53.37 [2019-03-28 12:43:19,964 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 46 transitions. Word has length 15 96.97/53.37 [2019-03-28 12:43:19,964 INFO L84 Accepts]: Finished accepts. word is rejected. 96.97/53.37 [2019-03-28 12:43:19,964 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 46 transitions. 96.97/53.37 [2019-03-28 12:43:19,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 96.97/53.37 [2019-03-28 12:43:19,965 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 46 transitions. 96.97/53.37 [2019-03-28 12:43:19,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 96.97/53.37 [2019-03-28 12:43:19,965 INFO L394 BasicCegarLoop]: Found error trace 96.97/53.37 [2019-03-28 12:43:19,965 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 96.97/53.37 [2019-03-28 12:43:19,966 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 96.97/53.37 [2019-03-28 12:43:19,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.37 [2019-03-28 12:43:19,966 INFO L82 PathProgramCache]: Analyzing trace with hash 762895276, now seen corresponding path program 1 times 96.97/53.37 [2019-03-28 12:43:19,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.37 [2019-03-28 12:43:19,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.37 [2019-03-28 12:43:19,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:19,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:19,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.37 [2019-03-28 12:43:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. 96.97/53.37 [2019-03-28 12:43:20,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 96.97/53.37 [2019-03-28 12:43:20,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 96.97/53.37 [2019-03-28 12:43:20,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 96.97/53.37 [2019-03-28 12:43:20,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 96.97/53.37 [2019-03-28 12:43:20,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 96.97/53.37 [2019-03-28 12:43:20,014 INFO L87 Difference]: Start difference. First operand 30 states and 46 transitions. Second operand 4 states. 96.97/53.37 [2019-03-28 12:43:20,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 96.97/53.37 [2019-03-28 12:43:20,092 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. 96.97/53.37 [2019-03-28 12:43:20,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 96.97/53.37 [2019-03-28 12:43:20,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 96.97/53.37 [2019-03-28 12:43:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 96.97/53.37 [2019-03-28 12:43:20,093 INFO L225 Difference]: With dead ends: 33 96.97/53.37 [2019-03-28 12:43:20,093 INFO L226 Difference]: Without dead ends: 30 96.97/53.37 [2019-03-28 12:43:20,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 96.97/53.37 [2019-03-28 12:43:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 96.97/53.37 [2019-03-28 12:43:20,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. 96.97/53.37 [2019-03-28 12:43:20,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 96.97/53.37 [2019-03-28 12:43:20,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. 96.97/53.37 [2019-03-28 12:43:20,098 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 41 transitions. Word has length 18 96.97/53.37 [2019-03-28 12:43:20,098 INFO L84 Accepts]: Finished accepts. word is rejected. 96.97/53.37 [2019-03-28 12:43:20,098 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 41 transitions. 96.97/53.37 [2019-03-28 12:43:20,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 96.97/53.37 [2019-03-28 12:43:20,098 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 41 transitions. 96.97/53.37 [2019-03-28 12:43:20,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 96.97/53.37 [2019-03-28 12:43:20,099 INFO L394 BasicCegarLoop]: Found error trace 96.97/53.37 [2019-03-28 12:43:20,099 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 96.97/53.37 [2019-03-28 12:43:20,099 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 96.97/53.37 [2019-03-28 12:43:20,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.37 [2019-03-28 12:43:20,100 INFO L82 PathProgramCache]: Analyzing trace with hash 762895277, now seen corresponding path program 1 times 96.97/53.37 [2019-03-28 12:43:20,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.37 [2019-03-28 12:43:20,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.37 [2019-03-28 12:43:20,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:20,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:20,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.37 [2019-03-28 12:43:20,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. 96.97/53.37 [2019-03-28 12:43:20,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 96.97/53.37 [2019-03-28 12:43:20,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 96.97/53.37 [2019-03-28 12:43:20,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 96.97/53.37 [2019-03-28 12:43:20,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 96.97/53.37 [2019-03-28 12:43:20,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 96.97/53.37 [2019-03-28 12:43:20,136 INFO L87 Difference]: Start difference. First operand 27 states and 41 transitions. Second operand 4 states. 96.97/53.37 [2019-03-28 12:43:20,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 96.97/53.37 [2019-03-28 12:43:20,239 INFO L93 Difference]: Finished difference Result 32 states and 47 transitions. 96.97/53.37 [2019-03-28 12:43:20,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 96.97/53.37 [2019-03-28 12:43:20,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 96.97/53.37 [2019-03-28 12:43:20,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 96.97/53.37 [2019-03-28 12:43:20,240 INFO L225 Difference]: With dead ends: 32 96.97/53.37 [2019-03-28 12:43:20,240 INFO L226 Difference]: Without dead ends: 30 96.97/53.37 [2019-03-28 12:43:20,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 96.97/53.37 [2019-03-28 12:43:20,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 96.97/53.37 [2019-03-28 12:43:20,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. 96.97/53.37 [2019-03-28 12:43:20,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 96.97/53.37 [2019-03-28 12:43:20,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 43 transitions. 96.97/53.37 [2019-03-28 12:43:20,245 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 43 transitions. Word has length 18 96.97/53.37 [2019-03-28 12:43:20,245 INFO L84 Accepts]: Finished accepts. word is rejected. 96.97/53.37 [2019-03-28 12:43:20,245 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 43 transitions. 96.97/53.37 [2019-03-28 12:43:20,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 96.97/53.37 [2019-03-28 12:43:20,245 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 43 transitions. 96.97/53.37 [2019-03-28 12:43:20,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 96.97/53.37 [2019-03-28 12:43:20,246 INFO L394 BasicCegarLoop]: Found error trace 96.97/53.37 [2019-03-28 12:43:20,246 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 96.97/53.37 [2019-03-28 12:43:20,246 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 96.97/53.37 [2019-03-28 12:43:20,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.37 [2019-03-28 12:43:20,247 INFO L82 PathProgramCache]: Analyzing trace with hash 762896676, now seen corresponding path program 1 times 96.97/53.37 [2019-03-28 12:43:20,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.37 [2019-03-28 12:43:20,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.37 [2019-03-28 12:43:20,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:20,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:20,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.37 [2019-03-28 12:43:20,267 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. 96.97/53.37 [2019-03-28 12:43:20,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 96.97/53.37 [2019-03-28 12:43:20,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 96.97/53.37 [2019-03-28 12:43:20,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 96.97/53.37 [2019-03-28 12:43:20,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 96.97/53.37 [2019-03-28 12:43:20,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 96.97/53.37 [2019-03-28 12:43:20,269 INFO L87 Difference]: Start difference. First operand 28 states and 43 transitions. Second operand 3 states. 96.97/53.37 [2019-03-28 12:43:20,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 96.97/53.37 [2019-03-28 12:43:20,321 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. 96.97/53.37 [2019-03-28 12:43:20,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 96.97/53.37 [2019-03-28 12:43:20,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 96.97/53.37 [2019-03-28 12:43:20,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 96.97/53.37 [2019-03-28 12:43:20,322 INFO L225 Difference]: With dead ends: 48 96.97/53.37 [2019-03-28 12:43:20,322 INFO L226 Difference]: Without dead ends: 30 96.97/53.37 [2019-03-28 12:43:20,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 96.97/53.37 [2019-03-28 12:43:20,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 96.97/53.37 [2019-03-28 12:43:20,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. 96.97/53.37 [2019-03-28 12:43:20,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 96.97/53.37 [2019-03-28 12:43:20,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 45 transitions. 96.97/53.37 [2019-03-28 12:43:20,327 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 45 transitions. Word has length 18 96.97/53.37 [2019-03-28 12:43:20,327 INFO L84 Accepts]: Finished accepts. word is rejected. 96.97/53.37 [2019-03-28 12:43:20,327 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 45 transitions. 96.97/53.37 [2019-03-28 12:43:20,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 96.97/53.37 [2019-03-28 12:43:20,328 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 45 transitions. 96.97/53.37 [2019-03-28 12:43:20,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 96.97/53.37 [2019-03-28 12:43:20,328 INFO L394 BasicCegarLoop]: Found error trace 96.97/53.37 [2019-03-28 12:43:20,328 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 96.97/53.37 [2019-03-28 12:43:20,329 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 96.97/53.37 [2019-03-28 12:43:20,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.37 [2019-03-28 12:43:20,329 INFO L82 PathProgramCache]: Analyzing trace with hash 762926467, now seen corresponding path program 1 times 96.97/53.37 [2019-03-28 12:43:20,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.37 [2019-03-28 12:43:20,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.37 [2019-03-28 12:43:20,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:20,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:20,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.37 [2019-03-28 12:43:20,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. 96.97/53.37 [2019-03-28 12:43:20,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 96.97/53.37 [2019-03-28 12:43:20,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 96.97/53.37 [2019-03-28 12:43:20,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 96.97/53.37 [2019-03-28 12:43:20,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 96.97/53.37 [2019-03-28 12:43:20,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 96.97/53.37 [2019-03-28 12:43:20,354 INFO L87 Difference]: Start difference. First operand 30 states and 45 transitions. Second operand 3 states. 96.97/53.37 [2019-03-28 12:43:20,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 96.97/53.37 [2019-03-28 12:43:20,400 INFO L93 Difference]: Finished difference Result 48 states and 69 transitions. 96.97/53.37 [2019-03-28 12:43:20,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 96.97/53.37 [2019-03-28 12:43:20,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 96.97/53.37 [2019-03-28 12:43:20,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 96.97/53.37 [2019-03-28 12:43:20,401 INFO L225 Difference]: With dead ends: 48 96.97/53.37 [2019-03-28 12:43:20,401 INFO L226 Difference]: Without dead ends: 0 96.97/53.37 [2019-03-28 12:43:20,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 96.97/53.37 [2019-03-28 12:43:20,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 96.97/53.37 [2019-03-28 12:43:20,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 96.97/53.37 [2019-03-28 12:43:20,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 96.97/53.37 [2019-03-28 12:43:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 96.97/53.37 [2019-03-28 12:43:20,402 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 96.97/53.37 [2019-03-28 12:43:20,403 INFO L84 Accepts]: Finished accepts. word is rejected. 96.97/53.37 [2019-03-28 12:43:20,403 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 96.97/53.37 [2019-03-28 12:43:20,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 96.97/53.37 [2019-03-28 12:43:20,403 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 96.97/53.37 [2019-03-28 12:43:20,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 96.97/53.37 [2019-03-28 12:43:20,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 96.97/53.37 [2019-03-28 12:43:20,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 96.97/53.37 [2019-03-28 12:43:20,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 96.97/53.37 [2019-03-28 12:43:20,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 96.97/53.37 [2019-03-28 12:43:20,647 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 96.97/53.37 [2019-03-28 12:43:20,906 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 96.97/53.37 [2019-03-28 12:43:20,908 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,909 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 33) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,909 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,909 INFO L448 ceAbstractionStarter]: For program point L31-2(lines 31 33) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,909 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,909 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,909 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,909 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 23 24) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,910 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,910 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,910 INFO L448 ceAbstractionStarter]: For program point L19-2(line 19) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,910 INFO L448 ceAbstractionStarter]: For program point L19-3(line 19) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,910 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,910 INFO L448 ceAbstractionStarter]: For program point L19-4(line 19) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,910 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,910 INFO L448 ceAbstractionStarter]: For program point L19-5(line 19) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,910 INFO L448 ceAbstractionStarter]: For program point L19-6(line 19) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,911 INFO L448 ceAbstractionStarter]: For program point L19-8(lines 19 20) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,911 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,911 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,911 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,911 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,911 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,911 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,911 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,911 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,912 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,912 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,912 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,912 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,912 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,912 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,912 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,912 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,913 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,913 INFO L444 ceAbstractionStarter]: At program point L17-3(lines 17 20) the Hoare annotation is: (let ((.cse10 (* 4 ULTIMATE.start_lis_~N))) (let ((.cse0 (= 0 ULTIMATE.start_lis_~best~0.offset)) (.cse1 (= 0 ULTIMATE.start_lis_~prev~0.offset)) (.cse2 (<= .cse10 (select |#length| ULTIMATE.start_lis_~a.base))) (.cse3 (= (select |#length| ULTIMATE.start_lis_~prev~0.base) .cse10)) (.cse4 (= (select |#length| ULTIMATE.start_lis_~best~0.base) .cse10)) (.cse5 (= 1 (select |#valid| ULTIMATE.start_lis_~best~0.base))) (.cse6 (= 1 (select |#valid| ULTIMATE.start_lis_~prev~0.base))) (.cse7 (<= 1 ULTIMATE.start_main_~array_size~0)) (.cse8 (= ULTIMATE.start_lis_~a.offset 0)) (.cse9 (= 1 (select |#valid| ULTIMATE.start_lis_~a.base)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ULTIMATE.start_lis_~i~0) .cse9) (and .cse0 .cse1 .cse3 (<= ULTIMATE.start_lis_~i~0 1) .cse4 .cse5 .cse6 .cse7 (<= 1 ULTIMATE.start_lis_~i~0) (<= ULTIMATE.start_lis_~N 1) .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 1 ULTIMATE.start_lis_~i~0) .cse6 .cse7 .cse8 .cse9)))) 96.97/53.37 [2019-03-28 12:43:20,914 INFO L448 ceAbstractionStarter]: For program point L22-2(lines 22 24) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,914 INFO L444 ceAbstractionStarter]: At program point L22-3(lines 22 24) the Hoare annotation is: (let ((.cse0 (* 4 ULTIMATE.start_lis_~N))) (and (= 0 ULTIMATE.start_lis_~best~0.offset) (= 0 ULTIMATE.start_lis_~prev~0.offset) (<= 0 ULTIMATE.start_lis_~i~0) (= (select |#length| ULTIMATE.start_lis_~prev~0.base) .cse0) (= (select |#length| ULTIMATE.start_lis_~best~0.base) .cse0) (= 1 (select |#valid| ULTIMATE.start_lis_~best~0.base)) (= 1 (select |#valid| ULTIMATE.start_lis_~prev~0.base)))) 96.97/53.37 [2019-03-28 12:43:20,914 INFO L448 ceAbstractionStarter]: For program point L18-2(lines 18 20) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,914 INFO L444 ceAbstractionStarter]: At program point L18-3(lines 18 20) the Hoare annotation is: (and (let ((.cse10 (select |#length| ULTIMATE.start_lis_~best~0.base)) (.cse11 (* 4 ULTIMATE.start_lis_~N))) (let ((.cse0 (<= .cse11 (select |#length| ULTIMATE.start_lis_~a.base))) (.cse1 (= (select |#length| ULTIMATE.start_lis_~prev~0.base) .cse11)) (.cse2 (= 1 (select |#valid| ULTIMATE.start_lis_~best~0.base))) (.cse3 (= 1 (select |#valid| ULTIMATE.start_lis_~a.base))) (.cse4 (<= (+ (* 4 ULTIMATE.start_lis_~i~0) 4) .cse10)) (.cse5 (= 0 ULTIMATE.start_lis_~best~0.offset)) (.cse6 (= 0 ULTIMATE.start_lis_~prev~0.offset)) (.cse7 (= .cse10 .cse11)) (.cse8 (= 1 (select |#valid| ULTIMATE.start_lis_~prev~0.base))) (.cse9 (<= 1 ULTIMATE.start_main_~array_size~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 1 ULTIMATE.start_lis_~i~0) .cse8 .cse9) (and .cse0 .cse1 .cse2 (<= 2 ULTIMATE.start_lis_~i~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) (<= 0 ULTIMATE.start_lis_~j~0) (= ULTIMATE.start_lis_~a.offset 0)) 96.97/53.37 [2019-03-28 12:43:20,914 INFO L444 ceAbstractionStarter]: At program point L14-2(lines 14 15) the Hoare annotation is: (let ((.cse0 (* 4 ULTIMATE.start_lis_~N))) (and (= 0 ULTIMATE.start_lis_~best~0.offset) (= 0 ULTIMATE.start_lis_~prev~0.offset) (<= .cse0 (select |#length| ULTIMATE.start_lis_~a.base)) (<= 0 ULTIMATE.start_lis_~i~0) (= (select |#length| ULTIMATE.start_lis_~prev~0.base) .cse0) (= (select |#length| ULTIMATE.start_lis_~best~0.base) .cse0) (= 1 (select |#valid| ULTIMATE.start_lis_~best~0.base)) (= 1 (select |#valid| ULTIMATE.start_lis_~prev~0.base)) (<= 1 ULTIMATE.start_main_~array_size~0) (= ULTIMATE.start_lis_~a.offset 0) (= 1 (select |#valid| ULTIMATE.start_lis_~a.base)))) 96.97/53.37 [2019-03-28 12:43:20,914 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,915 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,915 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,915 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,915 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,915 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 96.97/53.37 [2019-03-28 12:43:20,916 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 96.97/53.37 [2019-03-28 12:43:20,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,938 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,939 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,939 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,939 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,940 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,940 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,940 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,948 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,949 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,949 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,949 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,953 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,953 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,953 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,954 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,955 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,955 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,956 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,956 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,957 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,957 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,959 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,959 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,959 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,960 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,960 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,960 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,961 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,961 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,963 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,963 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,964 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,964 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,964 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,964 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.37 [2019-03-28 12:43:20,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:43:20 BasicIcfg 96.97/53.37 [2019-03-28 12:43:20,967 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 96.97/53.37 [2019-03-28 12:43:20,968 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 96.97/53.37 [2019-03-28 12:43:20,968 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 96.97/53.37 [2019-03-28 12:43:20,972 INFO L276 PluginConnector]: BuchiAutomizer initialized 96.97/53.37 [2019-03-28 12:43:20,973 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 96.97/53.37 [2019-03-28 12:43:20,973 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:43:15" (1/5) ... 96.97/53.37 [2019-03-28 12:43:20,974 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b146732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:43:20, skipping insertion in model container 96.97/53.37 [2019-03-28 12:43:20,974 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 96.97/53.37 [2019-03-28 12:43:20,974 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:16" (2/5) ... 96.97/53.37 [2019-03-28 12:43:20,974 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b146732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:43:20, skipping insertion in model container 96.97/53.37 [2019-03-28 12:43:20,975 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 96.97/53.37 [2019-03-28 12:43:20,975 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:43:16" (3/5) ... 96.97/53.37 [2019-03-28 12:43:20,975 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b146732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:43:20, skipping insertion in model container 96.97/53.37 [2019-03-28 12:43:20,975 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 96.97/53.37 [2019-03-28 12:43:20,975 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:43:16" (4/5) ... 96.97/53.37 [2019-03-28 12:43:20,976 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b146732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:43:20, skipping insertion in model container 96.97/53.37 [2019-03-28 12:43:20,976 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 96.97/53.37 [2019-03-28 12:43:20,976 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:43:20" (5/5) ... 96.97/53.37 [2019-03-28 12:43:20,977 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 96.97/53.37 [2019-03-28 12:43:21,000 INFO L133 ementStrategyFactory]: Using default assertion order modulation 96.97/53.37 [2019-03-28 12:43:21,000 INFO L374 BuchiCegarLoop]: Interprodecural is true 96.97/53.37 [2019-03-28 12:43:21,000 INFO L375 BuchiCegarLoop]: Hoare is true 96.97/53.37 [2019-03-28 12:43:21,000 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 96.97/53.37 [2019-03-28 12:43:21,000 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 96.97/53.37 [2019-03-28 12:43:21,000 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 96.97/53.37 [2019-03-28 12:43:21,000 INFO L379 BuchiCegarLoop]: Difference is false 96.97/53.37 [2019-03-28 12:43:21,001 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 96.97/53.37 [2019-03-28 12:43:21,001 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 96.97/53.37 [2019-03-28 12:43:21,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states. 96.97/53.37 [2019-03-28 12:43:21,010 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 96.97/53.37 [2019-03-28 12:43:21,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 96.97/53.37 [2019-03-28 12:43:21,010 INFO L119 BuchiIsEmpty]: Starting construction of run 96.97/53.37 [2019-03-28 12:43:21,015 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 96.97/53.37 [2019-03-28 12:43:21,015 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 96.97/53.37 [2019-03-28 12:43:21,015 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 96.97/53.37 [2019-03-28 12:43:21,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states. 96.97/53.37 [2019-03-28 12:43:21,017 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 96.97/53.37 [2019-03-28 12:43:21,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 96.97/53.37 [2019-03-28 12:43:21,017 INFO L119 BuchiIsEmpty]: Starting construction of run 96.97/53.37 [2019-03-28 12:43:21,018 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 96.97/53.37 [2019-03-28 12:43:21,018 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 96.97/53.37 [2019-03-28 12:43:21,023 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 37#L31true [181] L31-->L31-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 10#L31-2true [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 20#L14-2true 96.97/53.37 [2019-03-28 12:43:21,023 INFO L796 eck$LassoCheckResult]: Loop: 20#L14-2true [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 25#L15true [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 47#L15-1true [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 20#L14-2true 96.97/53.37 [2019-03-28 12:43:21,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.37 [2019-03-28 12:43:21,024 INFO L82 PathProgramCache]: Analyzing trace with hash 303744, now seen corresponding path program 1 times 96.97/53.37 [2019-03-28 12:43:21,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.37 [2019-03-28 12:43:21,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.37 [2019-03-28 12:43:21,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:21,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:21,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.37 [2019-03-28 12:43:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.37 [2019-03-28 12:43:21,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.37 [2019-03-28 12:43:21,061 INFO L82 PathProgramCache]: Analyzing trace with hash 164054, now seen corresponding path program 1 times 96.97/53.37 [2019-03-28 12:43:21,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.37 [2019-03-28 12:43:21,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.37 [2019-03-28 12:43:21,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:21,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:21,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.37 [2019-03-28 12:43:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.37 [2019-03-28 12:43:21,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.37 [2019-03-28 12:43:21,072 INFO L82 PathProgramCache]: Analyzing trace with hash 459037175, now seen corresponding path program 1 times 96.97/53.37 [2019-03-28 12:43:21,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.37 [2019-03-28 12:43:21,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.37 [2019-03-28 12:43:21,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:21,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:21,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.37 [2019-03-28 12:43:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.37 [2019-03-28 12:43:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.37 [2019-03-28 12:43:21,391 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 96.97/53.37 [2019-03-28 12:43:21,500 INFO L216 LassoAnalysis]: Preferences: 96.97/53.37 [2019-03-28 12:43:21,501 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 96.97/53.37 [2019-03-28 12:43:21,502 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 96.97/53.37 [2019-03-28 12:43:21,502 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 96.97/53.37 [2019-03-28 12:43:21,502 INFO L127 ssoRankerPreferences]: Use exernal solver: false 96.97/53.37 [2019-03-28 12:43:21,502 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 96.97/53.37 [2019-03-28 12:43:21,502 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 96.97/53.37 [2019-03-28 12:43:21,502 INFO L130 ssoRankerPreferences]: Path of dumped script: 96.97/53.37 [2019-03-28 12:43:21,502 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 96.97/53.37 [2019-03-28 12:43:21,503 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 96.97/53.37 [2019-03-28 12:43:21,503 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 96.97/53.37 [2019-03-28 12:43:21,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.37 [2019-03-28 12:43:21,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.37 [2019-03-28 12:43:21,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.37 [2019-03-28 12:43:21,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.37 [2019-03-28 12:43:21,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.37 [2019-03-28 12:43:21,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.37 [2019-03-28 12:43:21,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.37 [2019-03-28 12:43:21,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.37 [2019-03-28 12:43:21,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.37 [2019-03-28 12:43:21,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.37 [2019-03-28 12:43:21,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.37 [2019-03-28 12:43:21,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.37 [2019-03-28 12:43:21,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.37 [2019-03-28 12:43:21,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.37 [2019-03-28 12:43:21,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.37 [2019-03-28 12:43:21,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.37 [2019-03-28 12:43:21,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.37 [2019-03-28 12:43:21,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.37 [2019-03-28 12:43:21,770 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 96.97/53.37 [2019-03-28 12:43:21,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.37 [2019-03-28 12:43:21,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.37 [2019-03-28 12:43:21,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.37 [2019-03-28 12:43:21,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.37 [2019-03-28 12:43:22,207 INFO L300 LassoAnalysis]: Preprocessing complete. 96.97/53.37 [2019-03-28 12:43:22,212 INFO L497 LassoAnalysis]: Using template 'affine'. 96.97/53.37 [2019-03-28 12:43:22,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.37 [2019-03-28 12:43:22,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.37 [2019-03-28 12:43:22,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.37 [2019-03-28 12:43:22,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.37 [2019-03-28 12:43:22,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.37 [2019-03-28 12:43:22,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.37 [2019-03-28 12:43:22,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.37 [2019-03-28 12:43:22,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.37 [2019-03-28 12:43:22,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.37 [2019-03-28 12:43:22,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.37 [2019-03-28 12:43:22,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.37 [2019-03-28 12:43:22,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.37 [2019-03-28 12:43:22,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.37 [2019-03-28 12:43:22,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.37 [2019-03-28 12:43:22,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.37 [2019-03-28 12:43:22,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.37 [2019-03-28 12:43:22,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.37 [2019-03-28 12:43:22,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.37 [2019-03-28 12:43:22,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.37 [2019-03-28 12:43:22,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.37 [2019-03-28 12:43:22,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.37 [2019-03-28 12:43:22,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.37 [2019-03-28 12:43:22,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.37 [2019-03-28 12:43:22,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.37 [2019-03-28 12:43:22,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.37 [2019-03-28 12:43:22,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.37 [2019-03-28 12:43:22,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.37 [2019-03-28 12:43:22,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.37 [2019-03-28 12:43:22,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.37 [2019-03-28 12:43:22,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.37 [2019-03-28 12:43:22,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,278 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.37 [2019-03-28 12:43:22,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.37 [2019-03-28 12:43:22,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.37 [2019-03-28 12:43:22,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,289 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.37 [2019-03-28 12:43:22,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.37 [2019-03-28 12:43:22,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,300 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.37 [2019-03-28 12:43:22,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.37 [2019-03-28 12:43:22,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.37 [2019-03-28 12:43:22,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,307 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.37 [2019-03-28 12:43:22,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.37 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.37 Number of strict supporting invariants: 0 96.97/53.37 Number of non-strict supporting invariants: 1 96.97/53.37 Consider only non-deceasing supporting invariants: true 96.97/53.37 Simplify termination arguments: true 96.97/53.37 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.37 [2019-03-28 12:43:22,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.37 [2019-03-28 12:43:22,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.37 [2019-03-28 12:43:22,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.37 [2019-03-28 12:43:22,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.37 [2019-03-28 12:43:22,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.37 [2019-03-28 12:43:22,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.37 [2019-03-28 12:43:22,354 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 96.97/53.37 [2019-03-28 12:43:22,404 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. 96.97/53.37 [2019-03-28 12:43:22,405 INFO L444 ModelExtractionUtils]: 29 out of 40 variables were initially zero. Simplification set additionally 7 variables to zero. 96.97/53.38 [2019-03-28 12:43:22,407 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 96.97/53.38 [2019-03-28 12:43:22,408 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 96.97/53.38 [2019-03-28 12:43:22,409 INFO L518 LassoAnalysis]: Proved termination. 96.97/53.38 [2019-03-28 12:43:22,409 INFO L520 LassoAnalysis]: Termination argument consisting of: 96.97/53.38 Ranking function f(v_rep(select #length ULTIMATE.start_lis_~prev~0.base)_1, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~prev~0.offset) = 1*v_rep(select #length ULTIMATE.start_lis_~prev~0.base)_1 - 4*ULTIMATE.start_lis_~i~0 - 1*ULTIMATE.start_lis_~prev~0.offset 96.97/53.38 Supporting invariants [] 96.97/53.38 [2019-03-28 12:43:22,453 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed 96.97/53.38 [2019-03-28 12:43:22,457 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.38 [2019-03-28 12:43:22,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.38 [2019-03-28 12:43:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.38 [2019-03-28 12:43:22,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core 96.97/53.38 [2019-03-28 12:43:22,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.38 [2019-03-28 12:43:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.38 [2019-03-28 12:43:22,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 96.97/53.38 [2019-03-28 12:43:22,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.38 [2019-03-28 12:43:22,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 96.97/53.38 [2019-03-28 12:43:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.38 [2019-03-28 12:43:22,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 96.97/53.38 [2019-03-28 12:43:22,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.38 [2019-03-28 12:43:22,546 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 2 predicates after loop cannibalization 96.97/53.38 [2019-03-28 12:43:22,551 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 96.97/53.38 [2019-03-28 12:43:22,552 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 47 states. Second operand 3 states. 96.97/53.38 [2019-03-28 12:43:22,681 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 47 states.. Second operand 3 states. Result 62 states and 112 transitions. Complement of second has 4 states. 96.97/53.38 [2019-03-28 12:43:22,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 96.97/53.38 [2019-03-28 12:43:22,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 96.97/53.38 [2019-03-28 12:43:22,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. 96.97/53.38 [2019-03-28 12:43:22,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 97 transitions. Stem has 3 letters. Loop has 3 letters. 96.97/53.38 [2019-03-28 12:43:22,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.38 [2019-03-28 12:43:22,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 97 transitions. Stem has 6 letters. Loop has 3 letters. 96.97/53.38 [2019-03-28 12:43:22,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.38 [2019-03-28 12:43:22,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 97 transitions. Stem has 3 letters. Loop has 6 letters. 96.97/53.38 [2019-03-28 12:43:22,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.38 [2019-03-28 12:43:22,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 112 transitions. 96.97/53.38 [2019-03-28 12:43:22,700 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 96.97/53.38 [2019-03-28 12:43:22,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 30 states and 49 transitions. 96.97/53.38 [2019-03-28 12:43:22,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 96.97/53.38 [2019-03-28 12:43:22,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 96.97/53.38 [2019-03-28 12:43:22,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 49 transitions. 96.97/53.38 [2019-03-28 12:43:22,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 96.97/53.38 [2019-03-28 12:43:22,704 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 49 transitions. 96.97/53.38 [2019-03-28 12:43:22,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 49 transitions. 96.97/53.38 [2019-03-28 12:43:22,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. 96.97/53.38 [2019-03-28 12:43:22,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 96.97/53.38 [2019-03-28 12:43:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. 96.97/53.38 [2019-03-28 12:43:22,706 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. 96.97/53.38 [2019-03-28 12:43:22,707 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. 96.97/53.38 [2019-03-28 12:43:22,707 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 96.97/53.38 [2019-03-28 12:43:22,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 47 transitions. 96.97/53.38 [2019-03-28 12:43:22,708 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 96.97/53.38 [2019-03-28 12:43:22,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 96.97/53.38 [2019-03-28 12:43:22,708 INFO L119 BuchiIsEmpty]: Starting construction of run 96.97/53.38 [2019-03-28 12:43:22,708 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 96.97/53.38 [2019-03-28 12:43:22,708 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 96.97/53.38 [2019-03-28 12:43:22,709 INFO L794 eck$LassoCheckResult]: Stem: 247#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 246#L31 [181] L31-->L31-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 225#L31-2 [230] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (> |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (> 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 226#L14-2 96.97/53.38 [2019-03-28 12:43:22,709 INFO L796 eck$LassoCheckResult]: Loop: 226#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 235#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 240#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 226#L14-2 96.97/53.38 [2019-03-28 12:43:22,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.38 [2019-03-28 12:43:22,709 INFO L82 PathProgramCache]: Analyzing trace with hash 303751, now seen corresponding path program 1 times 96.97/53.38 [2019-03-28 12:43:22,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.38 [2019-03-28 12:43:22,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.38 [2019-03-28 12:43:22,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:22,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:22,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:22,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.38 [2019-03-28 12:43:22,749 INFO L82 PathProgramCache]: Analyzing trace with hash 164054, now seen corresponding path program 2 times 96.97/53.38 [2019-03-28 12:43:22,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.38 [2019-03-28 12:43:22,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.38 [2019-03-28 12:43:22,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:22,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:22,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:22,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.38 [2019-03-28 12:43:22,756 INFO L82 PathProgramCache]: Analyzing trace with hash 459245712, now seen corresponding path program 1 times 96.97/53.38 [2019-03-28 12:43:22,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.38 [2019-03-28 12:43:22,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.38 [2019-03-28 12:43:22,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:22,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:22,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:23,109 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 96.97/53.38 [2019-03-28 12:43:23,216 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 74 96.97/53.38 [2019-03-28 12:43:23,218 INFO L216 LassoAnalysis]: Preferences: 96.97/53.38 [2019-03-28 12:43:23,218 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 96.97/53.38 [2019-03-28 12:43:23,219 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 96.97/53.38 [2019-03-28 12:43:23,219 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 96.97/53.38 [2019-03-28 12:43:23,219 INFO L127 ssoRankerPreferences]: Use exernal solver: false 96.97/53.38 [2019-03-28 12:43:23,219 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 96.97/53.38 [2019-03-28 12:43:23,219 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 96.97/53.38 [2019-03-28 12:43:23,219 INFO L130 ssoRankerPreferences]: Path of dumped script: 96.97/53.38 [2019-03-28 12:43:23,219 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 96.97/53.38 [2019-03-28 12:43:23,219 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 96.97/53.38 [2019-03-28 12:43:23,219 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 96.97/53.38 [2019-03-28 12:43:23,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:23,420 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 96.97/53.38 [2019-03-28 12:43:23,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:23,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:23,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:23,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:23,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:23,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:23,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:23,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:23,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:23,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:23,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:23,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:23,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:23,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:23,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:23,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:23,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:23,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:23,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:23,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:23,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:23,853 INFO L300 LassoAnalysis]: Preprocessing complete. 96.97/53.38 [2019-03-28 12:43:23,853 INFO L497 LassoAnalysis]: Using template 'affine'. 96.97/53.38 [2019-03-28 12:43:23,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:23,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:23,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:23,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:23,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:23,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:23,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:23,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:23,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:23,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:23,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:23,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:23,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:23,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:23,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:23,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:23,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:23,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:23,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:23,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:23,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:23,871 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:23,871 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:23,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:23,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:23,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:23,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:23,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:23,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:23,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:23,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:23,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:23,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:23,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:23,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:23,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:23,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:23,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:23,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:23,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:23,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:23,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:23,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:23,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:23,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:23,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:23,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:23,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:23,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:23,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:23,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:23,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:23,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:23,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:23,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:23,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:23,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:23,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:23,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:23,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:23,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:23,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:23,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:23,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:23,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:23,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:23,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:23,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:23,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:23,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:23,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:23,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:23,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:23,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:23,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:23,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:23,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:23,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:23,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:23,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:23,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:23,929 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 96.97/53.38 [2019-03-28 12:43:23,955 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 96.97/53.38 [2019-03-28 12:43:23,956 INFO L444 ModelExtractionUtils]: 30 out of 40 variables were initially zero. Simplification set additionally 6 variables to zero. 96.97/53.38 [2019-03-28 12:43:23,956 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 96.97/53.38 [2019-03-28 12:43:23,957 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 96.97/53.38 [2019-03-28 12:43:23,958 INFO L518 LassoAnalysis]: Proved termination. 96.97/53.38 [2019-03-28 12:43:23,958 INFO L520 LassoAnalysis]: Termination argument consisting of: 96.97/53.38 Ranking function f(v_rep(select #length ULTIMATE.start_lis_~best~0.base)_2, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~best~0.offset) = 1*v_rep(select #length ULTIMATE.start_lis_~best~0.base)_2 - 4*ULTIMATE.start_lis_~i~0 - 1*ULTIMATE.start_lis_~best~0.offset 96.97/53.38 Supporting invariants [] 96.97/53.38 [2019-03-28 12:43:24,001 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed 96.97/53.38 [2019-03-28 12:43:24,002 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.38 [2019-03-28 12:43:24,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.38 [2019-03-28 12:43:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.38 [2019-03-28 12:43:24,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core 96.97/53.38 [2019-03-28 12:43:24,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.38 [2019-03-28 12:43:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.38 [2019-03-28 12:43:24,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 96.97/53.38 [2019-03-28 12:43:24,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.38 [2019-03-28 12:43:24,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 96.97/53.38 [2019-03-28 12:43:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.38 [2019-03-28 12:43:24,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 96.97/53.38 [2019-03-28 12:43:24,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.38 [2019-03-28 12:43:24,075 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 96.97/53.38 [2019-03-28 12:43:24,076 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 96.97/53.38 [2019-03-28 12:43:24,076 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22 Second operand 4 states. 96.97/53.38 [2019-03-28 12:43:24,117 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22. Second operand 4 states. Result 36 states and 58 transitions. Complement of second has 6 states. 96.97/53.38 [2019-03-28 12:43:24,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 96.97/53.38 [2019-03-28 12:43:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 96.97/53.38 [2019-03-28 12:43:24,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. 96.97/53.38 [2019-03-28 12:43:24,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 3 letters. Loop has 3 letters. 96.97/53.38 [2019-03-28 12:43:24,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.38 [2019-03-28 12:43:24,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 6 letters. Loop has 3 letters. 96.97/53.38 [2019-03-28 12:43:24,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.38 [2019-03-28 12:43:24,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 3 letters. Loop has 6 letters. 96.97/53.38 [2019-03-28 12:43:24,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.38 [2019-03-28 12:43:24,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 58 transitions. 96.97/53.38 [2019-03-28 12:43:24,127 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 96.97/53.38 [2019-03-28 12:43:24,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 55 transitions. 96.97/53.38 [2019-03-28 12:43:24,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 96.97/53.38 [2019-03-28 12:43:24,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 96.97/53.38 [2019-03-28 12:43:24,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 55 transitions. 96.97/53.38 [2019-03-28 12:43:24,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 96.97/53.38 [2019-03-28 12:43:24,129 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 55 transitions. 96.97/53.38 [2019-03-28 12:43:24,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 55 transitions. 96.97/53.38 [2019-03-28 12:43:24,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. 96.97/53.38 [2019-03-28 12:43:24,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 96.97/53.38 [2019-03-28 12:43:24,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. 96.97/53.38 [2019-03-28 12:43:24,131 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. 96.97/53.38 [2019-03-28 12:43:24,131 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. 96.97/53.38 [2019-03-28 12:43:24,131 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 96.97/53.38 [2019-03-28 12:43:24,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 47 transitions. 96.97/53.38 [2019-03-28 12:43:24,132 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 96.97/53.38 [2019-03-28 12:43:24,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 96.97/53.38 [2019-03-28 12:43:24,132 INFO L119 BuchiIsEmpty]: Starting construction of run 96.97/53.38 [2019-03-28 12:43:24,132 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 96.97/53.38 [2019-03-28 12:43:24,132 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 96.97/53.38 [2019-03-28 12:43:24,133 INFO L794 eck$LassoCheckResult]: Stem: 425#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 424#L31 [181] L31-->L31-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 403#L31-2 [229] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 404#L14-2 96.97/53.38 [2019-03-28 12:43:24,133 INFO L796 eck$LassoCheckResult]: Loop: 404#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 417#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 418#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 404#L14-2 96.97/53.38 [2019-03-28 12:43:24,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.38 [2019-03-28 12:43:24,134 INFO L82 PathProgramCache]: Analyzing trace with hash 303750, now seen corresponding path program 1 times 96.97/53.38 [2019-03-28 12:43:24,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.38 [2019-03-28 12:43:24,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.38 [2019-03-28 12:43:24,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:24,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:24,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:24,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.38 [2019-03-28 12:43:24,147 INFO L82 PathProgramCache]: Analyzing trace with hash 164054, now seen corresponding path program 3 times 96.97/53.38 [2019-03-28 12:43:24,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.38 [2019-03-28 12:43:24,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.38 [2019-03-28 12:43:24,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:24,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:24,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:24,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.38 [2019-03-28 12:43:24,154 INFO L82 PathProgramCache]: Analyzing trace with hash 459215921, now seen corresponding path program 1 times 96.97/53.38 [2019-03-28 12:43:24,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.38 [2019-03-28 12:43:24,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.38 [2019-03-28 12:43:24,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:24,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:24,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:24,455 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 96.97/53.38 [2019-03-28 12:43:24,544 INFO L216 LassoAnalysis]: Preferences: 96.97/53.38 [2019-03-28 12:43:24,545 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 96.97/53.38 [2019-03-28 12:43:24,545 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 96.97/53.38 [2019-03-28 12:43:24,545 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 96.97/53.38 [2019-03-28 12:43:24,545 INFO L127 ssoRankerPreferences]: Use exernal solver: false 96.97/53.38 [2019-03-28 12:43:24,545 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 96.97/53.38 [2019-03-28 12:43:24,545 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 96.97/53.38 [2019-03-28 12:43:24,545 INFO L130 ssoRankerPreferences]: Path of dumped script: 96.97/53.38 [2019-03-28 12:43:24,545 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 96.97/53.38 [2019-03-28 12:43:24,546 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 96.97/53.38 [2019-03-28 12:43:24,546 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 96.97/53.38 [2019-03-28 12:43:24,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:24,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:24,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:24,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:24,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:24,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:24,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:24,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:24,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:24,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:24,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:24,793 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 96.97/53.38 [2019-03-28 12:43:24,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:24,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:24,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:24,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:24,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:24,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:24,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:24,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:24,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:24,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:24,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:25,209 INFO L300 LassoAnalysis]: Preprocessing complete. 96.97/53.38 [2019-03-28 12:43:25,209 INFO L497 LassoAnalysis]: Using template 'affine'. 96.97/53.38 [2019-03-28 12:43:25,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:25,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:25,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:25,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:25,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:25,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:25,212 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:25,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:25,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:25,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:25,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:25,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:25,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:25,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:25,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:25,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:25,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:25,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:25,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:25,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:25,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:25,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:25,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:25,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:25,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:25,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:25,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:25,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:25,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:25,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:25,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:25,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:25,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:25,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:25,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:25,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:25,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:25,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:25,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:25,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:25,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:25,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:25,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:25,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:25,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:25,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:25,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:25,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:25,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:25,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:25,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:25,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:25,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:25,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:25,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:25,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:25,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:25,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:25,226 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:25,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:25,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:25,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:25,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:25,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:25,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:25,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:25,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:25,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:25,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:25,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:25,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:25,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:25,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:25,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:25,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:25,231 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:25,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:25,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:25,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:25,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:25,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:25,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:25,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:25,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:25,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:25,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:25,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:25,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:25,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:25,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:25,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:25,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:25,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:25,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:25,259 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 96.97/53.38 [2019-03-28 12:43:25,286 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. 96.97/53.38 [2019-03-28 12:43:25,286 INFO L444 ModelExtractionUtils]: 28 out of 40 variables were initially zero. Simplification set additionally 8 variables to zero. 96.97/53.38 [2019-03-28 12:43:25,287 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 96.97/53.38 [2019-03-28 12:43:25,288 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 96.97/53.38 [2019-03-28 12:43:25,288 INFO L518 LassoAnalysis]: Proved termination. 96.97/53.38 [2019-03-28 12:43:25,288 INFO L520 LassoAnalysis]: Termination argument consisting of: 96.97/53.38 Ranking function f(ULTIMATE.start_lis_~i~0, v_rep(select #length ULTIMATE.start_lis_~best~0.base)_3, ULTIMATE.start_lis_~best~0.offset) = -4*ULTIMATE.start_lis_~i~0 + 1*v_rep(select #length ULTIMATE.start_lis_~best~0.base)_3 - 1*ULTIMATE.start_lis_~best~0.offset 96.97/53.38 Supporting invariants [] 96.97/53.38 [2019-03-28 12:43:25,331 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed 96.97/53.38 [2019-03-28 12:43:25,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.38 [2019-03-28 12:43:25,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.38 [2019-03-28 12:43:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.38 [2019-03-28 12:43:25,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core 96.97/53.38 [2019-03-28 12:43:25,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.38 [2019-03-28 12:43:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.38 [2019-03-28 12:43:25,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 96.97/53.38 [2019-03-28 12:43:25,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.38 [2019-03-28 12:43:25,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 96.97/53.38 [2019-03-28 12:43:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.38 [2019-03-28 12:43:25,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 96.97/53.38 [2019-03-28 12:43:25,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.38 [2019-03-28 12:43:25,432 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 96.97/53.38 [2019-03-28 12:43:25,432 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 96.97/53.38 [2019-03-28 12:43:25,432 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22 Second operand 4 states. 96.97/53.38 [2019-03-28 12:43:25,485 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22. Second operand 4 states. Result 36 states and 58 transitions. Complement of second has 6 states. 96.97/53.38 [2019-03-28 12:43:25,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 96.97/53.38 [2019-03-28 12:43:25,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 96.97/53.38 [2019-03-28 12:43:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. 96.97/53.38 [2019-03-28 12:43:25,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 3 letters. Loop has 3 letters. 96.97/53.38 [2019-03-28 12:43:25,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.38 [2019-03-28 12:43:25,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 6 letters. Loop has 3 letters. 96.97/53.38 [2019-03-28 12:43:25,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.38 [2019-03-28 12:43:25,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 3 letters. Loop has 6 letters. 96.97/53.38 [2019-03-28 12:43:25,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.38 [2019-03-28 12:43:25,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 58 transitions. 96.97/53.38 [2019-03-28 12:43:25,493 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 96.97/53.38 [2019-03-28 12:43:25,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 55 transitions. 96.97/53.38 [2019-03-28 12:43:25,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 96.97/53.38 [2019-03-28 12:43:25,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 96.97/53.38 [2019-03-28 12:43:25,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 55 transitions. 96.97/53.38 [2019-03-28 12:43:25,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 96.97/53.38 [2019-03-28 12:43:25,495 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 55 transitions. 96.97/53.38 [2019-03-28 12:43:25,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 55 transitions. 96.97/53.38 [2019-03-28 12:43:25,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. 96.97/53.38 [2019-03-28 12:43:25,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 96.97/53.38 [2019-03-28 12:43:25,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. 96.97/53.38 [2019-03-28 12:43:25,497 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. 96.97/53.38 [2019-03-28 12:43:25,497 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. 96.97/53.38 [2019-03-28 12:43:25,497 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 96.97/53.38 [2019-03-28 12:43:25,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 47 transitions. 96.97/53.38 [2019-03-28 12:43:25,498 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 96.97/53.38 [2019-03-28 12:43:25,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 96.97/53.38 [2019-03-28 12:43:25,498 INFO L119 BuchiIsEmpty]: Starting construction of run 96.97/53.38 [2019-03-28 12:43:25,498 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 96.97/53.38 [2019-03-28 12:43:25,498 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 96.97/53.38 [2019-03-28 12:43:25,499 INFO L794 eck$LassoCheckResult]: Stem: 603#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 602#L31 [181] L31-->L31-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 581#L31-2 [228] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (> |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (> 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 582#L14-2 96.97/53.38 [2019-03-28 12:43:25,499 INFO L796 eck$LassoCheckResult]: Loop: 582#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 593#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 594#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 582#L14-2 96.97/53.38 [2019-03-28 12:43:25,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.38 [2019-03-28 12:43:25,500 INFO L82 PathProgramCache]: Analyzing trace with hash 303749, now seen corresponding path program 1 times 96.97/53.38 [2019-03-28 12:43:25,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.38 [2019-03-28 12:43:25,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.38 [2019-03-28 12:43:25,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:25,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:25,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:25,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.38 [2019-03-28 12:43:25,511 INFO L82 PathProgramCache]: Analyzing trace with hash 164054, now seen corresponding path program 4 times 96.97/53.38 [2019-03-28 12:43:25,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.38 [2019-03-28 12:43:25,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.38 [2019-03-28 12:43:25,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:25,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:25,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:25,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.38 [2019-03-28 12:43:25,519 INFO L82 PathProgramCache]: Analyzing trace with hash 459186130, now seen corresponding path program 1 times 96.97/53.38 [2019-03-28 12:43:25,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.38 [2019-03-28 12:43:25,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.38 [2019-03-28 12:43:25,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:25,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:25,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:25,843 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 96.97/53.38 [2019-03-28 12:43:25,947 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 73 96.97/53.38 [2019-03-28 12:43:25,950 INFO L216 LassoAnalysis]: Preferences: 96.97/53.38 [2019-03-28 12:43:25,950 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 96.97/53.38 [2019-03-28 12:43:25,950 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 96.97/53.38 [2019-03-28 12:43:25,950 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 96.97/53.38 [2019-03-28 12:43:25,950 INFO L127 ssoRankerPreferences]: Use exernal solver: false 96.97/53.38 [2019-03-28 12:43:25,950 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 96.97/53.38 [2019-03-28 12:43:25,951 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 96.97/53.38 [2019-03-28 12:43:25,951 INFO L130 ssoRankerPreferences]: Path of dumped script: 96.97/53.38 [2019-03-28 12:43:25,951 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 96.97/53.38 [2019-03-28 12:43:25,951 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 96.97/53.38 [2019-03-28 12:43:25,951 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 96.97/53.38 [2019-03-28 12:43:25,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:25,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:25,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:25,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:25,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:25,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:25,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:25,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:25,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:25,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:25,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:25,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:25,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:25,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:25,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:25,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:25,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:25,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:25,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:25,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:26,185 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 96.97/53.38 [2019-03-28 12:43:26,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:26,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:26,590 INFO L300 LassoAnalysis]: Preprocessing complete. 96.97/53.38 [2019-03-28 12:43:26,590 INFO L497 LassoAnalysis]: Using template 'affine'. 96.97/53.38 [2019-03-28 12:43:26,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:26,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,592 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:26,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:26,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:26,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:26,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:26,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:26,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:26,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:26,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:26,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:26,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:26,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:26,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:26,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:26,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,629 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,635 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,635 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,640 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,640 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:26,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,647 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,647 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,653 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,653 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:26,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:26,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:26,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:26,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:26,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:26,688 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:26,688 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:26,706 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 96.97/53.38 [2019-03-28 12:43:26,721 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. 96.97/53.38 [2019-03-28 12:43:26,721 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. 96.97/53.38 [2019-03-28 12:43:26,721 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 96.97/53.38 [2019-03-28 12:43:26,722 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 96.97/53.38 [2019-03-28 12:43:26,722 INFO L518 LassoAnalysis]: Proved termination. 96.97/53.38 [2019-03-28 12:43:26,722 INFO L520 LassoAnalysis]: Termination argument consisting of: 96.97/53.38 Ranking function f(ULTIMATE.start_lis_~i~0, v_rep(select #length ULTIMATE.start_lis_~prev~0.base)_4, ULTIMATE.start_lis_~prev~0.offset) = -4*ULTIMATE.start_lis_~i~0 + 1*v_rep(select #length ULTIMATE.start_lis_~prev~0.base)_4 - 1*ULTIMATE.start_lis_~prev~0.offset 96.97/53.38 Supporting invariants [] 96.97/53.38 [2019-03-28 12:43:26,765 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed 96.97/53.38 [2019-03-28 12:43:26,767 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.38 [2019-03-28 12:43:26,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.38 [2019-03-28 12:43:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.38 [2019-03-28 12:43:26,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core 96.97/53.38 [2019-03-28 12:43:26,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.38 [2019-03-28 12:43:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.38 [2019-03-28 12:43:26,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 96.97/53.38 [2019-03-28 12:43:26,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.38 [2019-03-28 12:43:26,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 96.97/53.38 [2019-03-28 12:43:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.38 [2019-03-28 12:43:26,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 96.97/53.38 [2019-03-28 12:43:26,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.38 [2019-03-28 12:43:26,829 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 2 predicates after loop cannibalization 96.97/53.38 [2019-03-28 12:43:26,829 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 96.97/53.38 [2019-03-28 12:43:26,830 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22 Second operand 3 states. 96.97/53.38 [2019-03-28 12:43:26,872 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22. Second operand 3 states. Result 36 states and 58 transitions. Complement of second has 4 states. 96.97/53.38 [2019-03-28 12:43:26,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 96.97/53.38 [2019-03-28 12:43:26,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 96.97/53.38 [2019-03-28 12:43:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. 96.97/53.38 [2019-03-28 12:43:26,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 3 letters. Loop has 3 letters. 96.97/53.38 [2019-03-28 12:43:26,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.38 [2019-03-28 12:43:26,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 6 letters. Loop has 3 letters. 96.97/53.38 [2019-03-28 12:43:26,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.38 [2019-03-28 12:43:26,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 3 letters. Loop has 6 letters. 96.97/53.38 [2019-03-28 12:43:26,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.38 [2019-03-28 12:43:26,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 58 transitions. 96.97/53.38 [2019-03-28 12:43:26,880 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 96.97/53.38 [2019-03-28 12:43:26,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 55 transitions. 96.97/53.38 [2019-03-28 12:43:26,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 96.97/53.38 [2019-03-28 12:43:26,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 96.97/53.38 [2019-03-28 12:43:26,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 55 transitions. 96.97/53.38 [2019-03-28 12:43:26,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 96.97/53.38 [2019-03-28 12:43:26,881 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 55 transitions. 96.97/53.38 [2019-03-28 12:43:26,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 55 transitions. 96.97/53.38 [2019-03-28 12:43:26,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. 96.97/53.38 [2019-03-28 12:43:26,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 96.97/53.38 [2019-03-28 12:43:26,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. 96.97/53.38 [2019-03-28 12:43:26,883 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. 96.97/53.38 [2019-03-28 12:43:26,883 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. 96.97/53.38 [2019-03-28 12:43:26,883 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 96.97/53.38 [2019-03-28 12:43:26,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 47 transitions. 96.97/53.38 [2019-03-28 12:43:26,884 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 96.97/53.38 [2019-03-28 12:43:26,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 96.97/53.38 [2019-03-28 12:43:26,884 INFO L119 BuchiIsEmpty]: Starting construction of run 96.97/53.38 [2019-03-28 12:43:26,884 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 96.97/53.38 [2019-03-28 12:43:26,884 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 96.97/53.38 [2019-03-28 12:43:26,885 INFO L794 eck$LassoCheckResult]: Stem: 776#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 775#L31 [181] L31-->L31-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 754#L31-2 [227] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (> 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 755#L14-2 96.97/53.38 [2019-03-28 12:43:26,885 INFO L796 eck$LassoCheckResult]: Loop: 755#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 766#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 767#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 755#L14-2 96.97/53.38 [2019-03-28 12:43:26,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.38 [2019-03-28 12:43:26,886 INFO L82 PathProgramCache]: Analyzing trace with hash 303748, now seen corresponding path program 1 times 96.97/53.38 [2019-03-28 12:43:26,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.38 [2019-03-28 12:43:26,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.38 [2019-03-28 12:43:26,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:26,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:26,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:26,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.38 [2019-03-28 12:43:26,895 INFO L82 PathProgramCache]: Analyzing trace with hash 164054, now seen corresponding path program 5 times 96.97/53.38 [2019-03-28 12:43:26,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.38 [2019-03-28 12:43:26,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.38 [2019-03-28 12:43:26,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:26,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:26,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:26,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.38 [2019-03-28 12:43:26,901 INFO L82 PathProgramCache]: Analyzing trace with hash 459156339, now seen corresponding path program 1 times 96.97/53.38 [2019-03-28 12:43:26,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.38 [2019-03-28 12:43:26,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.38 [2019-03-28 12:43:26,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:26,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:26,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:27,216 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 96.97/53.38 [2019-03-28 12:43:27,338 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 73 96.97/53.38 [2019-03-28 12:43:27,341 INFO L216 LassoAnalysis]: Preferences: 96.97/53.38 [2019-03-28 12:43:27,341 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 96.97/53.38 [2019-03-28 12:43:27,341 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 96.97/53.38 [2019-03-28 12:43:27,341 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 96.97/53.38 [2019-03-28 12:43:27,341 INFO L127 ssoRankerPreferences]: Use exernal solver: false 96.97/53.38 [2019-03-28 12:43:27,342 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 96.97/53.38 [2019-03-28 12:43:27,342 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 96.97/53.38 [2019-03-28 12:43:27,342 INFO L130 ssoRankerPreferences]: Path of dumped script: 96.97/53.38 [2019-03-28 12:43:27,342 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 96.97/53.38 [2019-03-28 12:43:27,342 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 96.97/53.38 [2019-03-28 12:43:27,342 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 96.97/53.38 [2019-03-28 12:43:27,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:27,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:27,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:27,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:27,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:27,616 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 96.97/53.38 [2019-03-28 12:43:27,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:27,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:27,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:27,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:27,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:27,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:27,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:27,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:27,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:27,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:27,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:27,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:27,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:27,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:27,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:27,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:27,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:28,049 INFO L300 LassoAnalysis]: Preprocessing complete. 96.97/53.38 [2019-03-28 12:43:28,049 INFO L497 LassoAnalysis]: Using template 'affine'. 96.97/53.38 [2019-03-28 12:43:28,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:28,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:28,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:28,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:28,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:28,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:28,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:28,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:28,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:28,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:28,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:28,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:28,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:28,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:28,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:28,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:28,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:28,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:28,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:28,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:28,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:28,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:28,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:28,058 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:28,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:28,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:28,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:28,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:28,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:28,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:28,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:28,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:28,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:28,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:28,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:28,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:28,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:28,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:28,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:28,063 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:28,063 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:28,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:28,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:28,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:28,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:28,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:28,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:28,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:28,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:28,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:28,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:28,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:28,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:28,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:28,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:28,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:28,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:28,086 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 96.97/53.38 [2019-03-28 12:43:28,099 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 96.97/53.38 [2019-03-28 12:43:28,100 INFO L444 ModelExtractionUtils]: 32 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. 96.97/53.38 [2019-03-28 12:43:28,100 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 96.97/53.38 [2019-03-28 12:43:28,101 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 96.97/53.38 [2019-03-28 12:43:28,101 INFO L518 LassoAnalysis]: Proved termination. 96.97/53.38 [2019-03-28 12:43:28,101 INFO L520 LassoAnalysis]: Termination argument consisting of: 96.97/53.38 Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~best~0.offset, v_rep(select #length ULTIMATE.start_lis_~best~0.base)_5) = -4*ULTIMATE.start_lis_~i~0 - 1*ULTIMATE.start_lis_~best~0.offset + 1*v_rep(select #length ULTIMATE.start_lis_~best~0.base)_5 96.97/53.38 Supporting invariants [] 96.97/53.38 [2019-03-28 12:43:28,144 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed 96.97/53.38 [2019-03-28 12:43:28,145 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.38 [2019-03-28 12:43:28,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.38 [2019-03-28 12:43:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.38 [2019-03-28 12:43:28,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core 96.97/53.38 [2019-03-28 12:43:28,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.38 [2019-03-28 12:43:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.38 [2019-03-28 12:43:28,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 96.97/53.38 [2019-03-28 12:43:28,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.38 [2019-03-28 12:43:28,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 96.97/53.38 [2019-03-28 12:43:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.38 [2019-03-28 12:43:28,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 96.97/53.38 [2019-03-28 12:43:28,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.38 [2019-03-28 12:43:28,233 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 96.97/53.38 [2019-03-28 12:43:28,234 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 96.97/53.38 [2019-03-28 12:43:28,234 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22 Second operand 4 states. 96.97/53.38 [2019-03-28 12:43:28,279 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22. Second operand 4 states. Result 36 states and 58 transitions. Complement of second has 6 states. 96.97/53.38 [2019-03-28 12:43:28,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 96.97/53.38 [2019-03-28 12:43:28,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 96.97/53.38 [2019-03-28 12:43:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. 96.97/53.38 [2019-03-28 12:43:28,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 3 letters. Loop has 3 letters. 96.97/53.38 [2019-03-28 12:43:28,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.38 [2019-03-28 12:43:28,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 6 letters. Loop has 3 letters. 96.97/53.38 [2019-03-28 12:43:28,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.38 [2019-03-28 12:43:28,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 3 letters. Loop has 6 letters. 96.97/53.38 [2019-03-28 12:43:28,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.38 [2019-03-28 12:43:28,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 58 transitions. 96.97/53.38 [2019-03-28 12:43:28,287 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 96.97/53.38 [2019-03-28 12:43:28,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 55 transitions. 96.97/53.38 [2019-03-28 12:43:28,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 96.97/53.38 [2019-03-28 12:43:28,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 96.97/53.38 [2019-03-28 12:43:28,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 55 transitions. 96.97/53.38 [2019-03-28 12:43:28,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 96.97/53.38 [2019-03-28 12:43:28,288 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 55 transitions. 96.97/53.38 [2019-03-28 12:43:28,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 55 transitions. 96.97/53.38 [2019-03-28 12:43:28,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. 96.97/53.38 [2019-03-28 12:43:28,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 96.97/53.38 [2019-03-28 12:43:28,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. 96.97/53.38 [2019-03-28 12:43:28,290 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. 96.97/53.38 [2019-03-28 12:43:28,290 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. 96.97/53.38 [2019-03-28 12:43:28,290 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 96.97/53.38 [2019-03-28 12:43:28,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 47 transitions. 96.97/53.38 [2019-03-28 12:43:28,291 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 96.97/53.38 [2019-03-28 12:43:28,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 96.97/53.38 [2019-03-28 12:43:28,291 INFO L119 BuchiIsEmpty]: Starting construction of run 96.97/53.38 [2019-03-28 12:43:28,291 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 96.97/53.38 [2019-03-28 12:43:28,292 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 96.97/53.38 [2019-03-28 12:43:28,292 INFO L794 eck$LassoCheckResult]: Stem: 954#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 953#L31 [181] L31-->L31-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 932#L31-2 [226] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (> 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 933#L14-2 96.97/53.38 [2019-03-28 12:43:28,292 INFO L796 eck$LassoCheckResult]: Loop: 933#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 944#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 945#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 933#L14-2 96.97/53.38 [2019-03-28 12:43:28,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.38 [2019-03-28 12:43:28,293 INFO L82 PathProgramCache]: Analyzing trace with hash 303747, now seen corresponding path program 1 times 96.97/53.38 [2019-03-28 12:43:28,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.38 [2019-03-28 12:43:28,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.38 [2019-03-28 12:43:28,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:28,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:28,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:28,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.38 [2019-03-28 12:43:28,305 INFO L82 PathProgramCache]: Analyzing trace with hash 164054, now seen corresponding path program 6 times 96.97/53.38 [2019-03-28 12:43:28,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.38 [2019-03-28 12:43:28,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.38 [2019-03-28 12:43:28,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:28,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:28,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:28,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.38 [2019-03-28 12:43:28,310 INFO L82 PathProgramCache]: Analyzing trace with hash 459126548, now seen corresponding path program 1 times 96.97/53.38 [2019-03-28 12:43:28,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.38 [2019-03-28 12:43:28,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.38 [2019-03-28 12:43:28,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:28,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:28,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:28,512 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 79 96.97/53.38 [2019-03-28 12:43:28,622 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 75 96.97/53.38 [2019-03-28 12:43:28,624 INFO L216 LassoAnalysis]: Preferences: 96.97/53.38 [2019-03-28 12:43:28,624 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 96.97/53.38 [2019-03-28 12:43:28,624 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 96.97/53.38 [2019-03-28 12:43:28,624 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 96.97/53.38 [2019-03-28 12:43:28,625 INFO L127 ssoRankerPreferences]: Use exernal solver: false 96.97/53.38 [2019-03-28 12:43:28,625 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 96.97/53.38 [2019-03-28 12:43:28,625 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 96.97/53.38 [2019-03-28 12:43:28,625 INFO L130 ssoRankerPreferences]: Path of dumped script: 96.97/53.38 [2019-03-28 12:43:28,625 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso 96.97/53.38 [2019-03-28 12:43:28,625 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 96.97/53.38 [2019-03-28 12:43:28,625 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 96.97/53.38 [2019-03-28 12:43:28,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:28,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:28,830 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 96.97/53.38 [2019-03-28 12:43:28,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:28,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:28,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:28,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:28,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:28,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:28,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:28,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:28,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:28,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:28,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:28,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:28,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:28,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:28,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:28,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:28,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:28,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:28,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:28,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.38 [2019-03-28 12:43:29,310 INFO L300 LassoAnalysis]: Preprocessing complete. 96.97/53.38 [2019-03-28 12:43:29,310 INFO L497 LassoAnalysis]: Using template 'affine'. 96.97/53.38 [2019-03-28 12:43:29,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:29,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:29,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:29,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:29,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:29,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:29,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:29,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:29,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:29,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:29,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:29,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:29,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:29,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:29,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:29,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:29,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:29,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:29,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:29,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.38 [2019-03-28 12:43:29,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:29,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:29,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:29,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:29,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:29,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.38 [2019-03-28 12:43:29,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.38 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.38 Number of strict supporting invariants: 0 96.97/53.38 Number of non-strict supporting invariants: 1 96.97/53.38 Consider only non-deceasing supporting invariants: true 96.97/53.38 Simplify termination arguments: true 96.97/53.38 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.38 [2019-03-28 12:43:29,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.38 [2019-03-28 12:43:29,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.38 [2019-03-28 12:43:29,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.38 [2019-03-28 12:43:29,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.38 [2019-03-28 12:43:29,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.38 [2019-03-28 12:43:29,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.38 [2019-03-28 12:43:29,336 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 96.97/53.38 [2019-03-28 12:43:29,348 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 96.97/53.38 [2019-03-28 12:43:29,348 INFO L444 ModelExtractionUtils]: 37 out of 43 variables were initially zero. Simplification set additionally 3 variables to zero. 96.97/53.38 [2019-03-28 12:43:29,349 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 96.97/53.38 [2019-03-28 12:43:29,349 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 96.97/53.38 [2019-03-28 12:43:29,350 INFO L518 LassoAnalysis]: Proved termination. 96.97/53.38 [2019-03-28 12:43:29,350 INFO L520 LassoAnalysis]: Termination argument consisting of: 96.97/53.38 Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N 96.97/53.38 Supporting invariants [] 96.97/53.38 [2019-03-28 12:43:29,394 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed 96.97/53.38 [2019-03-28 12:43:29,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.38 [2019-03-28 12:43:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.38 [2019-03-28 12:43:29,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core 96.97/53.38 [2019-03-28 12:43:29,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.38 [2019-03-28 12:43:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.38 [2019-03-28 12:43:29,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 96.97/53.38 [2019-03-28 12:43:29,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.38 [2019-03-28 12:43:29,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 96.97/53.38 [2019-03-28 12:43:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.38 [2019-03-28 12:43:29,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 96.97/53.38 [2019-03-28 12:43:29,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.38 [2019-03-28 12:43:29,492 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 96.97/53.38 [2019-03-28 12:43:29,493 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 96.97/53.38 [2019-03-28 12:43:29,493 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22 Second operand 3 states. 96.97/53.38 [2019-03-28 12:43:29,541 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22. Second operand 3 states. Result 36 states and 58 transitions. Complement of second has 4 states. 96.97/53.38 [2019-03-28 12:43:29,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 96.97/53.38 [2019-03-28 12:43:29,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 96.97/53.38 [2019-03-28 12:43:29,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. 96.97/53.38 [2019-03-28 12:43:29,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 3 letters. Loop has 3 letters. 96.97/53.38 [2019-03-28 12:43:29,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.38 [2019-03-28 12:43:29,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 6 letters. Loop has 3 letters. 96.97/53.38 [2019-03-28 12:43:29,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.38 [2019-03-28 12:43:29,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 3 letters. Loop has 6 letters. 96.97/53.38 [2019-03-28 12:43:29,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.38 [2019-03-28 12:43:29,547 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 58 transitions. 96.97/53.38 [2019-03-28 12:43:29,548 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 96.97/53.38 [2019-03-28 12:43:29,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 55 transitions. 96.97/53.38 [2019-03-28 12:43:29,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 96.97/53.38 [2019-03-28 12:43:29,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 96.97/53.38 [2019-03-28 12:43:29,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 55 transitions. 96.97/53.38 [2019-03-28 12:43:29,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 96.97/53.38 [2019-03-28 12:43:29,549 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 55 transitions. 96.97/53.38 [2019-03-28 12:43:29,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 55 transitions. 96.97/53.38 [2019-03-28 12:43:29,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. 96.97/53.38 [2019-03-28 12:43:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 96.97/53.38 [2019-03-28 12:43:29,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. 96.97/53.38 [2019-03-28 12:43:29,551 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. 96.97/53.38 [2019-03-28 12:43:29,551 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. 96.97/53.38 [2019-03-28 12:43:29,551 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 96.97/53.38 [2019-03-28 12:43:29,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 47 transitions. 96.97/53.38 [2019-03-28 12:43:29,552 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 96.97/53.38 [2019-03-28 12:43:29,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 96.97/53.38 [2019-03-28 12:43:29,552 INFO L119 BuchiIsEmpty]: Starting construction of run 96.97/53.38 [2019-03-28 12:43:29,552 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 96.97/53.38 [2019-03-28 12:43:29,552 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 96.97/53.38 [2019-03-28 12:43:29,553 INFO L794 eck$LassoCheckResult]: Stem: 1130#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 1129#L31 [181] L31-->L31-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 1108#L31-2 [225] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (> |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 1109#L14-2 96.97/53.38 [2019-03-28 12:43:29,553 INFO L796 eck$LassoCheckResult]: Loop: 1109#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 1122#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 1123#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 1109#L14-2 96.97/53.38 [2019-03-28 12:43:29,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.38 [2019-03-28 12:43:29,553 INFO L82 PathProgramCache]: Analyzing trace with hash 303746, now seen corresponding path program 1 times 96.97/53.38 [2019-03-28 12:43:29,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.38 [2019-03-28 12:43:29,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.38 [2019-03-28 12:43:29,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:29,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:29,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:29,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.38 [2019-03-28 12:43:29,562 INFO L82 PathProgramCache]: Analyzing trace with hash 164054, now seen corresponding path program 7 times 96.97/53.38 [2019-03-28 12:43:29,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.38 [2019-03-28 12:43:29,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.38 [2019-03-28 12:43:29,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:29,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:29,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:29,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.38 [2019-03-28 12:43:29,568 INFO L82 PathProgramCache]: Analyzing trace with hash 459096757, now seen corresponding path program 1 times 96.97/53.38 [2019-03-28 12:43:29,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.38 [2019-03-28 12:43:29,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.38 [2019-03-28 12:43:29,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:29,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:29,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.38 [2019-03-28 12:43:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.38 [2019-03-28 12:43:29,888 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 96.97/53.38 [2019-03-28 12:43:29,995 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 74 96.97/53.38 [2019-03-28 12:43:29,997 INFO L216 LassoAnalysis]: Preferences: 96.97/53.38 [2019-03-28 12:43:29,997 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 96.97/53.38 [2019-03-28 12:43:29,997 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 96.97/53.38 [2019-03-28 12:43:29,998 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 96.97/53.38 [2019-03-28 12:43:29,998 INFO L127 ssoRankerPreferences]: Use exernal solver: false 96.97/53.38 [2019-03-28 12:43:29,998 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 96.97/53.38 [2019-03-28 12:43:29,998 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 96.97/53.38 [2019-03-28 12:43:29,998 INFO L130 ssoRankerPreferences]: Path of dumped script: 96.97/53.38 [2019-03-28 12:43:29,998 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso 96.97/53.38 [2019-03-28 12:43:29,998 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 96.97/53.38 [2019-03-28 12:43:29,998 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 96.97/53.38 [2019-03-28 12:43:30,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:30,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:30,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:30,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:30,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:30,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:30,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:30,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:30,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:30,207 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 96.97/53.39 [2019-03-28 12:43:30,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:30,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:30,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:30,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:30,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:30,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:30,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:30,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:30,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:30,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:30,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:30,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:30,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:30,643 INFO L300 LassoAnalysis]: Preprocessing complete. 96.97/53.39 [2019-03-28 12:43:30,644 INFO L497 LassoAnalysis]: Using template 'affine'. 96.97/53.39 [2019-03-28 12:43:30,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:30,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:30,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:30,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:30,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:30,646 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:30,646 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:30,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:30,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:30,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:30,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.39 [2019-03-28 12:43:30,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:30,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:30,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:30,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:30,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:30,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:30,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:30,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:30,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:30,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:30,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:30,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:30,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:30,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:30,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:30,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:30,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.39 [2019-03-28 12:43:30,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:30,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:30,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:30,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:30,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:30,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:30,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:30,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:30,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.39 [2019-03-28 12:43:30,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:30,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:30,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:30,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:30,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:30,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:30,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:30,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:30,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.39 [2019-03-28 12:43:30,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:30,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:30,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:30,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:30,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:30,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:30,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:30,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:30,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.39 [2019-03-28 12:43:30,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:30,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:30,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:30,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:30,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:30,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:30,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:30,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:30,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.39 [2019-03-28 12:43:30,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:30,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:30,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:30,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:30,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:30,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:30,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:30,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:30,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:30,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:30,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:30,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:30,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:30,677 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 96.97/53.39 [2019-03-28 12:43:30,689 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 96.97/53.39 [2019-03-28 12:43:30,689 INFO L444 ModelExtractionUtils]: 33 out of 43 variables were initially zero. Simplification set additionally 7 variables to zero. 96.97/53.39 [2019-03-28 12:43:30,689 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 96.97/53.39 [2019-03-28 12:43:30,690 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 96.97/53.39 [2019-03-28 12:43:30,690 INFO L518 LassoAnalysis]: Proved termination. 96.97/53.39 [2019-03-28 12:43:30,690 INFO L520 LassoAnalysis]: Termination argument consisting of: 96.97/53.39 Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N 96.97/53.39 Supporting invariants [] 96.97/53.39 [2019-03-28 12:43:30,733 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed 96.97/53.39 [2019-03-28 12:43:30,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.39 [2019-03-28 12:43:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.39 [2019-03-28 12:43:30,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core 96.97/53.39 [2019-03-28 12:43:30,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.39 [2019-03-28 12:43:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.39 [2019-03-28 12:43:30,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 96.97/53.39 [2019-03-28 12:43:30,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.39 [2019-03-28 12:43:30,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 96.97/53.39 [2019-03-28 12:43:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.39 [2019-03-28 12:43:30,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 96.97/53.39 [2019-03-28 12:43:30,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.39 [2019-03-28 12:43:30,824 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 96.97/53.39 [2019-03-28 12:43:30,825 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 96.97/53.39 [2019-03-28 12:43:30,825 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22 Second operand 3 states. 96.97/53.39 [2019-03-28 12:43:30,872 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22. Second operand 3 states. Result 36 states and 58 transitions. Complement of second has 4 states. 96.97/53.39 [2019-03-28 12:43:30,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 96.97/53.39 [2019-03-28 12:43:30,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 96.97/53.39 [2019-03-28 12:43:30,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. 96.97/53.39 [2019-03-28 12:43:30,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 3 letters. Loop has 3 letters. 96.97/53.39 [2019-03-28 12:43:30,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.39 [2019-03-28 12:43:30,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 6 letters. Loop has 3 letters. 96.97/53.39 [2019-03-28 12:43:30,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.39 [2019-03-28 12:43:30,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 3 letters. Loop has 6 letters. 96.97/53.39 [2019-03-28 12:43:30,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.39 [2019-03-28 12:43:30,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 58 transitions. 96.97/53.39 [2019-03-28 12:43:30,879 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 96.97/53.39 [2019-03-28 12:43:30,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 55 transitions. 96.97/53.39 [2019-03-28 12:43:30,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 96.97/53.39 [2019-03-28 12:43:30,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 96.97/53.39 [2019-03-28 12:43:30,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 55 transitions. 96.97/53.39 [2019-03-28 12:43:30,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 96.97/53.39 [2019-03-28 12:43:30,880 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 55 transitions. 96.97/53.39 [2019-03-28 12:43:30,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 55 transitions. 96.97/53.39 [2019-03-28 12:43:30,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. 96.97/53.39 [2019-03-28 12:43:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 96.97/53.39 [2019-03-28 12:43:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. 96.97/53.39 [2019-03-28 12:43:30,882 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. 96.97/53.39 [2019-03-28 12:43:30,882 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. 96.97/53.39 [2019-03-28 12:43:30,882 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 96.97/53.39 [2019-03-28 12:43:30,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 47 transitions. 96.97/53.39 [2019-03-28 12:43:30,883 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 96.97/53.39 [2019-03-28 12:43:30,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 96.97/53.39 [2019-03-28 12:43:30,883 INFO L119 BuchiIsEmpty]: Starting construction of run 96.97/53.39 [2019-03-28 12:43:30,883 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 96.97/53.39 [2019-03-28 12:43:30,883 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 96.97/53.39 [2019-03-28 12:43:30,884 INFO L794 eck$LassoCheckResult]: Stem: 1306#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 1305#L31 [181] L31-->L31-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 1284#L31-2 [224] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (> |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 1285#L14-2 96.97/53.39 [2019-03-28 12:43:30,884 INFO L796 eck$LassoCheckResult]: Loop: 1285#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 1296#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 1297#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 1285#L14-2 96.97/53.39 [2019-03-28 12:43:30,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.39 [2019-03-28 12:43:30,884 INFO L82 PathProgramCache]: Analyzing trace with hash 303745, now seen corresponding path program 1 times 96.97/53.39 [2019-03-28 12:43:30,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.39 [2019-03-28 12:43:30,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.39 [2019-03-28 12:43:30,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.39 [2019-03-28 12:43:30,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.39 [2019-03-28 12:43:30,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.39 [2019-03-28 12:43:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.39 [2019-03-28 12:43:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.39 [2019-03-28 12:43:30,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.39 [2019-03-28 12:43:30,894 INFO L82 PathProgramCache]: Analyzing trace with hash 164054, now seen corresponding path program 8 times 96.97/53.39 [2019-03-28 12:43:30,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.39 [2019-03-28 12:43:30,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.39 [2019-03-28 12:43:30,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.39 [2019-03-28 12:43:30,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.39 [2019-03-28 12:43:30,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.39 [2019-03-28 12:43:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.39 [2019-03-28 12:43:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.39 [2019-03-28 12:43:30,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.39 [2019-03-28 12:43:30,899 INFO L82 PathProgramCache]: Analyzing trace with hash 459066966, now seen corresponding path program 1 times 96.97/53.39 [2019-03-28 12:43:30,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.39 [2019-03-28 12:43:30,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.39 [2019-03-28 12:43:30,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.39 [2019-03-28 12:43:30,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 96.97/53.39 [2019-03-28 12:43:30,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.39 [2019-03-28 12:43:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.39 [2019-03-28 12:43:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.39 [2019-03-28 12:43:31,114 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 79 96.97/53.39 [2019-03-28 12:43:31,258 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 75 96.97/53.39 [2019-03-28 12:43:31,260 INFO L216 LassoAnalysis]: Preferences: 96.97/53.39 [2019-03-28 12:43:31,260 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 96.97/53.39 [2019-03-28 12:43:31,260 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 96.97/53.39 [2019-03-28 12:43:31,260 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 96.97/53.39 [2019-03-28 12:43:31,260 INFO L127 ssoRankerPreferences]: Use exernal solver: false 96.97/53.39 [2019-03-28 12:43:31,260 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 96.97/53.39 [2019-03-28 12:43:31,260 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 96.97/53.39 [2019-03-28 12:43:31,261 INFO L130 ssoRankerPreferences]: Path of dumped script: 96.97/53.39 [2019-03-28 12:43:31,261 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Lasso 96.97/53.39 [2019-03-28 12:43:31,261 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 96.97/53.39 [2019-03-28 12:43:31,261 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 96.97/53.39 [2019-03-28 12:43:31,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:31,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:31,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:31,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:31,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:31,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:31,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:31,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:31,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:31,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:31,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:31,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:31,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:31,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:31,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:31,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:31,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:31,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:31,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:31,520 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 96.97/53.39 [2019-03-28 12:43:31,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:31,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:31,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:31,967 INFO L300 LassoAnalysis]: Preprocessing complete. 96.97/53.39 [2019-03-28 12:43:31,967 INFO L497 LassoAnalysis]: Using template 'affine'. 96.97/53.39 [2019-03-28 12:43:31,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:31,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:31,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.39 [2019-03-28 12:43:31,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:31,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:31,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:31,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:31,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:31,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:31,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:31,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:31,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.39 [2019-03-28 12:43:31,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:31,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:31,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:31,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:31,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:31,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:31,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:31,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:31,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:31,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:31,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:31,973 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:31,973 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:31,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:31,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:31,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:31,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:31,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:31,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:31,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:31,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:31,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:31,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:31,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:31,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.39 [2019-03-28 12:43:31,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:31,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:31,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:31,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:31,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:31,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:31,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:31,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:31,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:31,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:31,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:31,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:31,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:31,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:31,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:31,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:31,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.39 [2019-03-28 12:43:31,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:31,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:31,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:31,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:31,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:31,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:31,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:31,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:31,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.39 [2019-03-28 12:43:31,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:31,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:31,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:31,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:31,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:31,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:31,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:31,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:31,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.39 [2019-03-28 12:43:31,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:31,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:31,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:31,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:31,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:31,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:31,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:31,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:31,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.39 [2019-03-28 12:43:31,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:31,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:31,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:31,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:31,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:31,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:31,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:31,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:31,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.39 [2019-03-28 12:43:31,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:31,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:31,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:31,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:31,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:31,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:31,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:31,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:31,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.39 [2019-03-28 12:43:31,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:31,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:31,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:31,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:31,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:31,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:31,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:31,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:31,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.39 [2019-03-28 12:43:31,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:31,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:31,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:31,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:31,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:31,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:31,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:31,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:31,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:31,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:31,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:31,994 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:31,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:31,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:31,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:31,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:31,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.39 [2019-03-28 12:43:31,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:31,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:31,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:31,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:31,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:31,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:31,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:31,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:31,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.39 [2019-03-28 12:43:31,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:31,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:31,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:31,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:31,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:31,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:31,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:31,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:32,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.39 [2019-03-28 12:43:32,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:32,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:32,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:32,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:32,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:32,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:32,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:32,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:32,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.39 [2019-03-28 12:43:32,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:32,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:32,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:32,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:32,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:32,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:32,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:32,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:32,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:32,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:32,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:32,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:32,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:32,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:32,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:32,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:32,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.39 [2019-03-28 12:43:32,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:32,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:32,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:32,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:32,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:32,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:32,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:32,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:32,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.39 [2019-03-28 12:43:32,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:32,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:32,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:32,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:32,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:32,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:32,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:32,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:32,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:32,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:32,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:32,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:32,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:32,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:32,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:32,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:32,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:32,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:32,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:32,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:32,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:32,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 96.97/53.39 [2019-03-28 12:43:32,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:32,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:32,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:32,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:32,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:32,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:32,019 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:32,029 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 96.97/53.39 [2019-03-28 12:43:32,042 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 96.97/53.39 [2019-03-28 12:43:32,042 INFO L444 ModelExtractionUtils]: 32 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. 96.97/53.39 [2019-03-28 12:43:32,043 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 96.97/53.39 [2019-03-28 12:43:32,043 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 96.97/53.39 [2019-03-28 12:43:32,044 INFO L518 LassoAnalysis]: Proved termination. 96.97/53.39 [2019-03-28 12:43:32,044 INFO L520 LassoAnalysis]: Termination argument consisting of: 96.97/53.39 Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~prev~0.offset, v_rep(select #length ULTIMATE.start_lis_~prev~0.base)_8) = -4*ULTIMATE.start_lis_~i~0 - 1*ULTIMATE.start_lis_~prev~0.offset + 1*v_rep(select #length ULTIMATE.start_lis_~prev~0.base)_8 96.97/53.39 Supporting invariants [] 96.97/53.39 [2019-03-28 12:43:32,086 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed 96.97/53.39 [2019-03-28 12:43:32,087 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 96.97/53.39 [2019-03-28 12:43:32,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.39 [2019-03-28 12:43:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.39 [2019-03-28 12:43:32,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core 96.97/53.39 [2019-03-28 12:43:32,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.39 [2019-03-28 12:43:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.39 [2019-03-28 12:43:32,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 96.97/53.39 [2019-03-28 12:43:32,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.39 [2019-03-28 12:43:32,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 96.97/53.39 [2019-03-28 12:43:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.39 [2019-03-28 12:43:32,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 96.97/53.39 [2019-03-28 12:43:32,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.39 [2019-03-28 12:43:32,139 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 2 predicates after loop cannibalization 96.97/53.39 [2019-03-28 12:43:32,139 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 96.97/53.39 [2019-03-28 12:43:32,139 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22 Second operand 3 states. 96.97/53.39 [2019-03-28 12:43:32,179 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22. Second operand 3 states. Result 33 states and 54 transitions. Complement of second has 4 states. 96.97/53.39 [2019-03-28 12:43:32,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 96.97/53.39 [2019-03-28 12:43:32,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 96.97/53.39 [2019-03-28 12:43:32,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. 96.97/53.39 [2019-03-28 12:43:32,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 3 letters. Loop has 3 letters. 96.97/53.39 [2019-03-28 12:43:32,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.39 [2019-03-28 12:43:32,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 6 letters. Loop has 3 letters. 96.97/53.39 [2019-03-28 12:43:32,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.39 [2019-03-28 12:43:32,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 3 letters. Loop has 6 letters. 96.97/53.39 [2019-03-28 12:43:32,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.39 [2019-03-28 12:43:32,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 54 transitions. 96.97/53.39 [2019-03-28 12:43:32,187 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 96.97/53.39 [2019-03-28 12:43:32,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 51 transitions. 96.97/53.39 [2019-03-28 12:43:32,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 96.97/53.39 [2019-03-28 12:43:32,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 96.97/53.39 [2019-03-28 12:43:32,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 51 transitions. 96.97/53.39 [2019-03-28 12:43:32,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 96.97/53.39 [2019-03-28 12:43:32,188 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 51 transitions. 96.97/53.39 [2019-03-28 12:43:32,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 51 transitions. 96.97/53.39 [2019-03-28 12:43:32,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. 96.97/53.39 [2019-03-28 12:43:32,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 96.97/53.39 [2019-03-28 12:43:32,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 43 transitions. 96.97/53.39 [2019-03-28 12:43:32,189 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 43 transitions. 96.97/53.39 [2019-03-28 12:43:32,189 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 43 transitions. 96.97/53.39 [2019-03-28 12:43:32,190 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 96.97/53.39 [2019-03-28 12:43:32,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 43 transitions. 96.97/53.39 [2019-03-28 12:43:32,190 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 96.97/53.39 [2019-03-28 12:43:32,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 96.97/53.39 [2019-03-28 12:43:32,190 INFO L119 BuchiIsEmpty]: Starting construction of run 96.97/53.39 [2019-03-28 12:43:32,191 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 96.97/53.39 [2019-03-28 12:43:32,191 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 96.97/53.39 [2019-03-28 12:43:32,191 INFO L794 eck$LassoCheckResult]: Stem: 1473#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 1472#L31 [181] L31-->L31-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 1454#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 1455#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 1450#L17-3 96.97/53.39 [2019-03-28 12:43:32,191 INFO L796 eck$LassoCheckResult]: Loop: 1450#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 1449#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 1450#L17-3 96.97/53.39 [2019-03-28 12:43:32,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.39 [2019-03-28 12:43:32,192 INFO L82 PathProgramCache]: Analyzing trace with hash 9416344, now seen corresponding path program 1 times 96.97/53.39 [2019-03-28 12:43:32,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.39 [2019-03-28 12:43:32,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.39 [2019-03-28 12:43:32,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.39 [2019-03-28 12:43:32,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.39 [2019-03-28 12:43:32,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.39 [2019-03-28 12:43:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.39 [2019-03-28 12:43:32,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 96.97/53.39 [2019-03-28 12:43:32,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 96.97/53.39 [2019-03-28 12:43:32,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 96.97/53.39 [2019-03-28 12:43:32,209 INFO L799 eck$LassoCheckResult]: stem already infeasible 96.97/53.39 [2019-03-28 12:43:32,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.39 [2019-03-28 12:43:32,210 INFO L82 PathProgramCache]: Analyzing trace with hash 7165, now seen corresponding path program 1 times 96.97/53.39 [2019-03-28 12:43:32,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 96.97/53.39 [2019-03-28 12:43:32,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 96.97/53.39 [2019-03-28 12:43:32,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.39 [2019-03-28 12:43:32,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 96.97/53.39 [2019-03-28 12:43:32,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 96.97/53.39 [2019-03-28 12:43:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.39 [2019-03-28 12:43:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 96.97/53.39 [2019-03-28 12:43:32,226 INFO L216 LassoAnalysis]: Preferences: 96.97/53.39 [2019-03-28 12:43:32,226 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 96.97/53.39 [2019-03-28 12:43:32,227 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 96.97/53.39 [2019-03-28 12:43:32,227 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 96.97/53.39 [2019-03-28 12:43:32,227 INFO L127 ssoRankerPreferences]: Use exernal solver: true 96.97/53.39 [2019-03-28 12:43:32,227 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 96.97/53.39 [2019-03-28 12:43:32,227 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 96.97/53.39 [2019-03-28 12:43:32,227 INFO L130 ssoRankerPreferences]: Path of dumped script: 96.97/53.39 [2019-03-28 12:43:32,227 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Loop 96.97/53.39 [2019-03-28 12:43:32,227 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 96.97/53.39 [2019-03-28 12:43:32,228 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 96.97/53.39 [2019-03-28 12:43:32,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:32,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:32,257 INFO L300 LassoAnalysis]: Preprocessing complete. 96.97/53.39 [2019-03-28 12:43:32,258 INFO L412 LassoAnalysis]: Checking for nontermination... 96.97/53.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 96.97/53.39 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 96.97/53.39 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 96.97/53.39 [2019-03-28 12:43:32,265 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 96.97/53.39 [2019-03-28 12:43:32,265 INFO L163 nArgumentSynthesizer]: Using integer mode. 96.97/53.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 96.97/53.39 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 96.97/53.39 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 96.97/53.39 [2019-03-28 12:43:32,299 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 96.97/53.39 [2019-03-28 12:43:32,299 INFO L163 nArgumentSynthesizer]: Using integer mode. 96.97/53.39 [2019-03-28 12:43:32,457 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 96.97/53.39 [2019-03-28 12:43:32,459 INFO L216 LassoAnalysis]: Preferences: 96.97/53.39 [2019-03-28 12:43:32,459 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 96.97/53.39 [2019-03-28 12:43:32,460 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 96.97/53.39 [2019-03-28 12:43:32,460 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 96.97/53.39 [2019-03-28 12:43:32,460 INFO L127 ssoRankerPreferences]: Use exernal solver: false 96.97/53.39 [2019-03-28 12:43:32,460 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 96.97/53.39 [2019-03-28 12:43:32,460 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 96.97/53.39 [2019-03-28 12:43:32,460 INFO L130 ssoRankerPreferences]: Path of dumped script: 96.97/53.39 [2019-03-28 12:43:32,460 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Loop 96.97/53.39 [2019-03-28 12:43:32,460 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 96.97/53.39 [2019-03-28 12:43:32,461 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 96.97/53.39 [2019-03-28 12:43:32,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:32,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 96.97/53.39 [2019-03-28 12:43:32,493 INFO L300 LassoAnalysis]: Preprocessing complete. 96.97/53.39 [2019-03-28 12:43:32,493 INFO L497 LassoAnalysis]: Using template 'affine'. 96.97/53.39 [2019-03-28 12:43:32,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 96.97/53.39 Termination analysis: LINEAR_WITH_GUESSES 96.97/53.39 Number of strict supporting invariants: 0 96.97/53.39 Number of non-strict supporting invariants: 1 96.97/53.39 Consider only non-deceasing supporting invariants: true 96.97/53.39 Simplify termination arguments: true 96.97/53.39 Simplify supporting invariants: trueOverapproximate stem: false 96.97/53.39 [2019-03-28 12:43:32,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. 96.97/53.39 [2019-03-28 12:43:32,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 96.97/53.39 [2019-03-28 12:43:32,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 96.97/53.39 [2019-03-28 12:43:32,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 96.97/53.39 [2019-03-28 12:43:32,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 96.97/53.39 [2019-03-28 12:43:32,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 96.97/53.39 [2019-03-28 12:43:32,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 96.97/53.39 [2019-03-28 12:43:32,496 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 96.97/53.39 [2019-03-28 12:43:32,497 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 96.97/53.39 [2019-03-28 12:43:32,498 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. 96.97/53.39 [2019-03-28 12:43:32,498 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 96.97/53.39 [2019-03-28 12:43:32,498 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 96.97/53.39 [2019-03-28 12:43:32,498 INFO L518 LassoAnalysis]: Proved termination. 96.97/53.39 [2019-03-28 12:43:32,498 INFO L520 LassoAnalysis]: Termination argument consisting of: 96.97/53.39 Ranking function f(ULTIMATE.start_lis_~i~0) = -2*ULTIMATE.start_lis_~i~0 + 1 96.97/53.39 Supporting invariants [] 96.97/53.39 [2019-03-28 12:43:32,499 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 96.97/53.39 [2019-03-28 12:43:32,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 96.97/53.39 [2019-03-28 12:43:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.39 [2019-03-28 12:43:32,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core 96.97/53.39 [2019-03-28 12:43:32,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.39 [2019-03-28 12:43:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 96.97/53.39 [2019-03-28 12:43:32,530 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core 96.97/53.39 [2019-03-28 12:43:32,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... 96.97/53.39 [2019-03-28 12:43:32,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 96.97/53.39 [2019-03-28 12:43:32,557 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 96.97/53.39 [2019-03-28 12:43:32,558 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 96.97/53.39 [2019-03-28 12:43:32,558 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 26 states and 43 transitions. cyclomatic complexity: 20 Second operand 3 states. 96.97/53.39 [2019-03-28 12:43:32,688 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 26 states and 43 transitions. cyclomatic complexity: 20. Second operand 3 states. Result 81 states and 119 transitions. Complement of second has 9 states. 96.97/53.39 [2019-03-28 12:43:32,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states 96.97/53.39 [2019-03-28 12:43:32,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 96.97/53.39 [2019-03-28 12:43:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. 96.97/53.39 [2019-03-28 12:43:32,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 88 transitions. Stem has 4 letters. Loop has 2 letters. 96.97/53.39 [2019-03-28 12:43:32,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.39 [2019-03-28 12:43:32,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 88 transitions. Stem has 6 letters. Loop has 2 letters. 96.97/53.39 [2019-03-28 12:43:32,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.39 [2019-03-28 12:43:32,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 88 transitions. Stem has 4 letters. Loop has 4 letters. 96.97/53.39 [2019-03-28 12:43:32,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. 96.97/53.39 [2019-03-28 12:43:32,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 119 transitions. 96.97/53.39 [2019-03-28 12:43:32,696 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 96.97/53.39 [2019-03-28 12:43:32,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 76 states and 112 transitions. 96.97/53.39 [2019-03-28 12:43:32,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 96.97/53.39 [2019-03-28 12:43:32,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 96.97/53.39 [2019-03-28 12:43:32,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 112 transitions. 96.97/53.39 [2019-03-28 12:43:32,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 96.97/53.39 [2019-03-28 12:43:32,698 INFO L706 BuchiCegarLoop]: Abstraction has 76 states and 112 transitions. 96.97/53.39 [2019-03-28 12:43:32,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 112 transitions. 96.97/53.39 [2019-03-28 12:43:32,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 44. 96.97/53.39 [2019-03-28 12:43:32,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. 96.97/53.39 [2019-03-28 12:43:32,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 71 transitions. 96.97/53.39 [2019-03-28 12:43:32,700 INFO L729 BuchiCegarLoop]: Abstraction has 44 states and 71 transitions. 96.97/53.39 [2019-03-28 12:43:32,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 96.97/53.39 [2019-03-28 12:43:32,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 96.97/53.39 [2019-03-28 12:43:32,700 INFO L87 Difference]: Start difference. First operand 44 states and 71 transitions. Second operand 4 states. 96.97/53.39 [2019-03-28 12:43:32,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 96.97/53.39 [2019-03-28 12:43:32,773 INFO L93 Difference]: Finished difference Result 46 states and 72 transitions. 96.97/53.39 [2019-03-28 12:43:32,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 96.97/53.39 [2019-03-28 12:43:32,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 72 transitions. 96.97/53.39 [2019-03-28 12:43:32,779 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 96.97/53.39 [2019-03-28 12:43:32,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 72 transitions. 96.97/53.39 [2019-03-28 12:43:32,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 96.97/53.39 [2019-03-28 12:43:32,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 96.97/53.39 [2019-03-28 12:43:32,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 72 transitions. 96.97/53.39 [2019-03-28 12:43:32,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 96.97/53.39 [2019-03-28 12:43:32,781 INFO L706 BuchiCegarLoop]: Abstraction has 46 states and 72 transitions. 96.97/53.39 [2019-03-28 12:43:32,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 72 transitions. 96.97/53.39 [2019-03-28 12:43:32,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. 96.97/53.39 [2019-03-28 12:43:32,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. 96.97/53.39 [2019-03-28 12:43:32,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. 96.97/53.39 [2019-03-28 12:43:32,782 INFO L729 BuchiCegarLoop]: Abstraction has 44 states and 70 transitions. 96.97/53.39 [2019-03-28 12:43:32,783 INFO L609 BuchiCegarLoop]: Abstraction has 44 states and 70 transitions. 96.97/53.39 [2019-03-28 12:43:32,783 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ 96.97/53.39 [2019-03-28 12:43:32,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 70 transitions. 96.97/53.39 [2019-03-28 12:43:32,783 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 96.97/53.39 [2019-03-28 12:43:32,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 96.97/53.39 [2019-03-28 12:43:32,783 INFO L119 BuchiIsEmpty]: Starting construction of run 96.97/53.39 [2019-03-28 12:43:32,784 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 96.97/53.39 [2019-03-28 12:43:32,784 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 96.97/53.39 [2019-03-28 12:43:32,785 INFO L794 eck$LassoCheckResult]: Stem: 1736#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 1735#L31 [181] L31-->L31-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 1708#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 1709#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 1719#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 1726#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 1720#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 1721#L17-3 [282] L17-3-->L22-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_10 v_ULTIMATE.start_lis_~i~0_41) (= 0 v_ULTIMATE.start_lis_~i~0_40)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_41, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_40, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 1712#L22-3 97.09/53.39 [2019-03-28 12:43:32,785 INFO L796 eck$LassoCheckResult]: Loop: 1712#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 1713#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 1717#L23-1 [208] L23-1-->L22-2: Formula: (>= v_ULTIMATE.start_lis_~max~0_5 |v_ULTIMATE.start_lis_#t~mem12_6|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_6|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_5|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 1714#L22-2 [130] L22-2-->L22-3: Formula: (= (+ v_ULTIMATE.start_lis_~i~0_35 1) v_ULTIMATE.start_lis_~i~0_34) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_35} OutVars{ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_2|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_34} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post11] 1712#L22-3 97.09/53.39 [2019-03-28 12:43:32,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.39 [2019-03-28 12:43:32,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1246897351, now seen corresponding path program 1 times 97.09/53.39 [2019-03-28 12:43:32,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.39 [2019-03-28 12:43:32,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.39 [2019-03-28 12:43:32,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:32,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:32,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.39 [2019-03-28 12:43:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.39 [2019-03-28 12:43:32,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.39 [2019-03-28 12:43:32,806 INFO L82 PathProgramCache]: Analyzing trace with hash 4943235, now seen corresponding path program 1 times 97.09/53.39 [2019-03-28 12:43:32,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.39 [2019-03-28 12:43:32,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.39 [2019-03-28 12:43:32,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:32,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:32,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.39 [2019-03-28 12:43:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.39 [2019-03-28 12:43:32,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.39 [2019-03-28 12:43:32,811 INFO L82 PathProgramCache]: Analyzing trace with hash 682159291, now seen corresponding path program 1 times 97.09/53.39 [2019-03-28 12:43:32,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.39 [2019-03-28 12:43:32,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.39 [2019-03-28 12:43:32,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:32,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:32,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.39 [2019-03-28 12:43:32,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 97.09/53.39 [2019-03-28 12:43:32,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 97.09/53.39 [2019-03-28 12:43:32,975 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 97.09/53.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 97.09/53.39 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 97.09/53.39 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 97.09/53.39 [2019-03-28 12:43:32,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.39 [2019-03-28 12:43:33,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 23 conjunts are in the unsatisfiable core 97.09/53.39 [2019-03-28 12:43:33,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... 97.09/53.39 [2019-03-28 12:43:33,038 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 97.09/53.39 [2019-03-28 12:43:33,039 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 97.09/53.39 [2019-03-28 12:43:33,048 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 97.09/53.39 [2019-03-28 12:43:33,048 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 97.09/53.39 [2019-03-28 12:43:33,049 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 97.09/53.39 [2019-03-28 12:43:33,068 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 15 treesize of output 11 97.09/53.39 [2019-03-28 12:43:33,069 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 97.09/53.39 [2019-03-28 12:43:33,078 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 97.09/53.39 [2019-03-28 12:43:33,079 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 97.09/53.39 [2019-03-28 12:43:33,079 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 97.09/53.39 [2019-03-28 12:43:33,101 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 97.09/53.39 [2019-03-28 12:43:33,102 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 97.09/53.39 [2019-03-28 12:43:33,116 INFO L497 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size 97.09/53.39 [2019-03-28 12:43:33,117 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 97.09/53.39 [2019-03-28 12:43:33,117 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 97.09/53.39 [2019-03-28 12:43:33,161 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 97.09/53.39 [2019-03-28 12:43:33,162 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 22 treesize of output 18 97.09/53.39 [2019-03-28 12:43:33,162 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 97.09/53.39 [2019-03-28 12:43:33,167 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 97.09/53.39 [2019-03-28 12:43:33,167 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 97.09/53.39 [2019-03-28 12:43:33,168 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:7 97.09/53.39 [2019-03-28 12:43:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 97.09/53.39 [2019-03-28 12:43:33,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 97.09/53.39 [2019-03-28 12:43:33,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 97.09/53.39 [2019-03-28 12:43:33,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. 97.09/53.39 [2019-03-28 12:43:33,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 97.09/53.39 [2019-03-28 12:43:33,233 INFO L87 Difference]: Start difference. First operand 44 states and 70 transitions. cyclomatic complexity: 30 Second operand 12 states. 97.09/53.39 [2019-03-28 12:43:33,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 97.09/53.39 [2019-03-28 12:43:33,611 INFO L93 Difference]: Finished difference Result 83 states and 126 transitions. 97.09/53.39 [2019-03-28 12:43:33,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 97.09/53.39 [2019-03-28 12:43:33,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 126 transitions. 97.09/53.39 [2019-03-28 12:43:33,617 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 97.09/53.39 [2019-03-28 12:43:33,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 83 states and 126 transitions. 97.09/53.39 [2019-03-28 12:43:33,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 97.09/53.39 [2019-03-28 12:43:33,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 97.09/53.39 [2019-03-28 12:43:33,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 126 transitions. 97.09/53.39 [2019-03-28 12:43:33,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 97.09/53.39 [2019-03-28 12:43:33,619 INFO L706 BuchiCegarLoop]: Abstraction has 83 states and 126 transitions. 97.09/53.39 [2019-03-28 12:43:33,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 126 transitions. 97.09/53.39 [2019-03-28 12:43:33,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. 97.09/53.39 [2019-03-28 12:43:33,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. 97.09/53.39 [2019-03-28 12:43:33,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 119 transitions. 97.09/53.39 [2019-03-28 12:43:33,622 INFO L729 BuchiCegarLoop]: Abstraction has 76 states and 119 transitions. 97.09/53.39 [2019-03-28 12:43:33,622 INFO L609 BuchiCegarLoop]: Abstraction has 76 states and 119 transitions. 97.09/53.39 [2019-03-28 12:43:33,622 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ 97.09/53.39 [2019-03-28 12:43:33,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 119 transitions. 97.09/53.39 [2019-03-28 12:43:33,623 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 97.09/53.39 [2019-03-28 12:43:33,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 97.09/53.39 [2019-03-28 12:43:33,623 INFO L119 BuchiIsEmpty]: Starting construction of run 97.09/53.39 [2019-03-28 12:43:33,623 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 97.09/53.39 [2019-03-28 12:43:33,623 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 97.09/53.39 [2019-03-28 12:43:33,624 INFO L794 eck$LassoCheckResult]: Stem: 1929#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 1928#L31 [181] L31-->L31-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 1897#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 1898#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 1909#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 1932#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 1910#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 1912#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 1885#L18-3 97.09/53.39 [2019-03-28 12:43:33,624 INFO L796 eck$LassoCheckResult]: Loop: 1885#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 1886#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 1925#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 1922#L19-2 [251] L19-2-->L19-3: Formula: (and |v_ULTIMATE.start_lis_#t~short9_2| (< |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 1918#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 1919#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 1890#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 1891#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 1933#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 1885#L18-3 97.09/53.39 [2019-03-28 12:43:33,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.39 [2019-03-28 12:43:33,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1246897442, now seen corresponding path program 1 times 97.09/53.39 [2019-03-28 12:43:33,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.39 [2019-03-28 12:43:33,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.39 [2019-03-28 12:43:33,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:33,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:33,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.39 [2019-03-28 12:43:33,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 97.09/53.39 [2019-03-28 12:43:33,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 97.09/53.39 [2019-03-28 12:43:33,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 97.09/53.39 [2019-03-28 12:43:33,656 INFO L799 eck$LassoCheckResult]: stem already infeasible 97.09/53.39 [2019-03-28 12:43:33,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.39 [2019-03-28 12:43:33,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1205360556, now seen corresponding path program 1 times 97.09/53.39 [2019-03-28 12:43:33,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.39 [2019-03-28 12:43:33,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.39 [2019-03-28 12:43:33,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:33,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:33,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.39 [2019-03-28 12:43:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 97.09/53.39 [2019-03-28 12:43:33,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 97.09/53.39 [2019-03-28 12:43:33,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 97.09/53.39 [2019-03-28 12:43:33,668 INFO L811 eck$LassoCheckResult]: loop already infeasible 97.09/53.39 [2019-03-28 12:43:33,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 97.09/53.39 [2019-03-28 12:43:33,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 97.09/53.39 [2019-03-28 12:43:33,669 INFO L87 Difference]: Start difference. First operand 76 states and 119 transitions. cyclomatic complexity: 49 Second operand 5 states. 97.09/53.39 [2019-03-28 12:43:33,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 97.09/53.39 [2019-03-28 12:43:33,784 INFO L93 Difference]: Finished difference Result 94 states and 147 transitions. 97.09/53.39 [2019-03-28 12:43:33,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 97.09/53.39 [2019-03-28 12:43:33,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 147 transitions. 97.09/53.39 [2019-03-28 12:43:33,790 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 37 97.09/53.39 [2019-03-28 12:43:33,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 147 transitions. 97.09/53.39 [2019-03-28 12:43:33,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 97.09/53.39 [2019-03-28 12:43:33,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 97.09/53.39 [2019-03-28 12:43:33,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 147 transitions. 97.09/53.39 [2019-03-28 12:43:33,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 97.09/53.39 [2019-03-28 12:43:33,792 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 147 transitions. 97.09/53.39 [2019-03-28 12:43:33,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 147 transitions. 97.09/53.39 [2019-03-28 12:43:33,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. 97.09/53.39 [2019-03-28 12:43:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. 97.09/53.39 [2019-03-28 12:43:33,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. 97.09/53.39 [2019-03-28 12:43:33,795 INFO L729 BuchiCegarLoop]: Abstraction has 86 states and 138 transitions. 97.09/53.39 [2019-03-28 12:43:33,795 INFO L609 BuchiCegarLoop]: Abstraction has 86 states and 138 transitions. 97.09/53.39 [2019-03-28 12:43:33,795 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ 97.09/53.39 [2019-03-28 12:43:33,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 138 transitions. 97.09/53.39 [2019-03-28 12:43:33,796 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 97.09/53.39 [2019-03-28 12:43:33,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 97.09/53.39 [2019-03-28 12:43:33,796 INFO L119 BuchiIsEmpty]: Starting construction of run 97.09/53.39 [2019-03-28 12:43:33,797 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 97.09/53.39 [2019-03-28 12:43:33,797 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 97.09/53.39 [2019-03-28 12:43:33,797 INFO L794 eck$LassoCheckResult]: Stem: 2118#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 2116#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 2081#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 2082#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 2142#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 2140#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 2138#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 2139#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 2152#L18-3 97.09/53.39 [2019-03-28 12:43:33,798 INFO L796 eck$LassoCheckResult]: Loop: 2152#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 2151#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 2150#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 2109#L19-2 [251] L19-2-->L19-3: Formula: (and |v_ULTIMATE.start_lis_#t~short9_2| (< |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 2103#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 2105#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 2073#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 2074#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 2153#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 2152#L18-3 97.09/53.39 [2019-03-28 12:43:33,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.39 [2019-03-28 12:43:33,798 INFO L82 PathProgramCache]: Analyzing trace with hash -74291543, now seen corresponding path program 1 times 97.09/53.39 [2019-03-28 12:43:33,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.39 [2019-03-28 12:43:33,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.39 [2019-03-28 12:43:33,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:33,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:33,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.39 [2019-03-28 12:43:33,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 97.09/53.39 [2019-03-28 12:43:33,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 97.09/53.39 [2019-03-28 12:43:33,822 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 97.09/53.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 97.09/53.39 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 97.09/53.39 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 97.09/53.39 [2019-03-28 12:43:33,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.39 [2019-03-28 12:43:33,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core 97.09/53.39 [2019-03-28 12:43:33,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... 97.09/53.39 [2019-03-28 12:43:33,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 97.09/53.39 [2019-03-28 12:43:33,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 97.09/53.39 [2019-03-28 12:43:33,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 97.09/53.39 [2019-03-28 12:43:33,924 INFO L799 eck$LassoCheckResult]: stem already infeasible 97.09/53.39 [2019-03-28 12:43:33,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.39 [2019-03-28 12:43:33,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1205360556, now seen corresponding path program 2 times 97.09/53.39 [2019-03-28 12:43:33,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.39 [2019-03-28 12:43:33,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.39 [2019-03-28 12:43:33,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:33,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:33,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.39 [2019-03-28 12:43:33,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 97.09/53.39 [2019-03-28 12:43:33,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 97.09/53.39 [2019-03-28 12:43:33,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 97.09/53.39 [2019-03-28 12:43:33,937 INFO L811 eck$LassoCheckResult]: loop already infeasible 97.09/53.39 [2019-03-28 12:43:33,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 97.09/53.39 [2019-03-28 12:43:33,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 97.09/53.39 [2019-03-28 12:43:33,937 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. cyclomatic complexity: 59 Second operand 7 states. 97.09/53.39 [2019-03-28 12:43:34,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 97.09/53.39 [2019-03-28 12:43:34,040 INFO L93 Difference]: Finished difference Result 103 states and 152 transitions. 97.09/53.39 [2019-03-28 12:43:34,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 97.09/53.39 [2019-03-28 12:43:34,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 152 transitions. 97.09/53.39 [2019-03-28 12:43:34,046 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 97.09/53.39 [2019-03-28 12:43:34,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 103 states and 152 transitions. 97.09/53.39 [2019-03-28 12:43:34,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 97.09/53.39 [2019-03-28 12:43:34,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 97.09/53.39 [2019-03-28 12:43:34,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 152 transitions. 97.09/53.39 [2019-03-28 12:43:34,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 97.09/53.39 [2019-03-28 12:43:34,047 INFO L706 BuchiCegarLoop]: Abstraction has 103 states and 152 transitions. 97.09/53.39 [2019-03-28 12:43:34,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 152 transitions. 97.09/53.39 [2019-03-28 12:43:34,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 60. 97.09/53.39 [2019-03-28 12:43:34,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. 97.09/53.39 [2019-03-28 12:43:34,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 96 transitions. 97.09/53.39 [2019-03-28 12:43:34,050 INFO L729 BuchiCegarLoop]: Abstraction has 60 states and 96 transitions. 97.09/53.39 [2019-03-28 12:43:34,050 INFO L609 BuchiCegarLoop]: Abstraction has 60 states and 96 transitions. 97.09/53.39 [2019-03-28 12:43:34,050 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ 97.09/53.39 [2019-03-28 12:43:34,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 96 transitions. 97.09/53.39 [2019-03-28 12:43:34,051 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 97.09/53.39 [2019-03-28 12:43:34,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 97.09/53.39 [2019-03-28 12:43:34,051 INFO L119 BuchiIsEmpty]: Starting construction of run 97.09/53.39 [2019-03-28 12:43:34,051 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] 97.09/53.39 [2019-03-28 12:43:34,051 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 97.09/53.39 [2019-03-28 12:43:34,052 INFO L794 eck$LassoCheckResult]: Stem: 2332#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 2330#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 2331#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 2348#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 2347#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 2346#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 2345#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 2313#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 2344#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 2312#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 2314#L17-3 [282] L17-3-->L22-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_10 v_ULTIMATE.start_lis_~i~0_41) (= 0 v_ULTIMATE.start_lis_~i~0_40)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_41, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_40, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 2302#L22-3 97.09/53.39 [2019-03-28 12:43:34,052 INFO L796 eck$LassoCheckResult]: Loop: 2302#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 2303#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 2315#L23-1 [208] L23-1-->L22-2: Formula: (>= v_ULTIMATE.start_lis_~max~0_5 |v_ULTIMATE.start_lis_#t~mem12_6|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_6|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_5|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 2306#L22-2 [130] L22-2-->L22-3: Formula: (= (+ v_ULTIMATE.start_lis_~i~0_35 1) v_ULTIMATE.start_lis_~i~0_34) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_35} OutVars{ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_2|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_34} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post11] 2302#L22-3 97.09/53.39 [2019-03-28 12:43:34,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.39 [2019-03-28 12:43:34,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1446440329, now seen corresponding path program 1 times 97.09/53.39 [2019-03-28 12:43:34,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.39 [2019-03-28 12:43:34,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.39 [2019-03-28 12:43:34,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:34,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:34,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.39 [2019-03-28 12:43:34,106 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 97.09/53.39 [2019-03-28 12:43:34,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 97.09/53.39 [2019-03-28 12:43:34,106 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 97.09/53.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 97.09/53.39 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 97.09/53.39 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 97.09/53.39 [2019-03-28 12:43:34,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.39 [2019-03-28 12:43:34,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core 97.09/53.39 [2019-03-28 12:43:34,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... 97.09/53.39 [2019-03-28 12:43:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 97.09/53.39 [2019-03-28 12:43:34,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 97.09/53.39 [2019-03-28 12:43:34,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 97.09/53.39 [2019-03-28 12:43:34,197 INFO L799 eck$LassoCheckResult]: stem already infeasible 97.09/53.39 [2019-03-28 12:43:34,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.39 [2019-03-28 12:43:34,198 INFO L82 PathProgramCache]: Analyzing trace with hash 4943235, now seen corresponding path program 2 times 97.09/53.39 [2019-03-28 12:43:34,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.39 [2019-03-28 12:43:34,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.39 [2019-03-28 12:43:34,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:34,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:34,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.39 [2019-03-28 12:43:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.39 [2019-03-28 12:43:34,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 97.09/53.39 [2019-03-28 12:43:34,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 97.09/53.39 [2019-03-28 12:43:34,233 INFO L87 Difference]: Start difference. First operand 60 states and 96 transitions. cyclomatic complexity: 41 Second operand 11 states. 97.09/53.39 [2019-03-28 12:43:34,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 97.09/53.39 [2019-03-28 12:43:34,505 INFO L93 Difference]: Finished difference Result 96 states and 142 transitions. 97.09/53.39 [2019-03-28 12:43:34,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 97.09/53.39 [2019-03-28 12:43:34,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 142 transitions. 97.09/53.39 [2019-03-28 12:43:34,520 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 97.09/53.39 [2019-03-28 12:43:34,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 92 states and 137 transitions. 97.09/53.39 [2019-03-28 12:43:34,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 97.09/53.39 [2019-03-28 12:43:34,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 97.09/53.39 [2019-03-28 12:43:34,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 137 transitions. 97.09/53.39 [2019-03-28 12:43:34,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 97.09/53.39 [2019-03-28 12:43:34,522 INFO L706 BuchiCegarLoop]: Abstraction has 92 states and 137 transitions. 97.09/53.39 [2019-03-28 12:43:34,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 137 transitions. 97.09/53.39 [2019-03-28 12:43:34,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. 97.09/53.39 [2019-03-28 12:43:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. 97.09/53.39 [2019-03-28 12:43:34,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 89 transitions. 97.09/53.39 [2019-03-28 12:43:34,524 INFO L729 BuchiCegarLoop]: Abstraction has 56 states and 89 transitions. 97.09/53.39 [2019-03-28 12:43:34,524 INFO L609 BuchiCegarLoop]: Abstraction has 56 states and 89 transitions. 97.09/53.39 [2019-03-28 12:43:34,524 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ 97.09/53.39 [2019-03-28 12:43:34,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 89 transitions. 97.09/53.39 [2019-03-28 12:43:34,525 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 97.09/53.39 [2019-03-28 12:43:34,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 97.09/53.39 [2019-03-28 12:43:34,525 INFO L119 BuchiIsEmpty]: Starting construction of run 97.09/53.39 [2019-03-28 12:43:34,525 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] 97.09/53.39 [2019-03-28 12:43:34,525 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 97.09/53.39 [2019-03-28 12:43:34,526 INFO L794 eck$LassoCheckResult]: Stem: 2540#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 2538#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 2506#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 2507#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 2548#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 2545#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 2546#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 2520#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 2529#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 2519#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 2521#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 2495#L18-3 97.09/53.39 [2019-03-28 12:43:34,528 INFO L796 eck$LassoCheckResult]: Loop: 2495#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 2496#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 2536#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 2534#L19-2 [251] L19-2-->L19-3: Formula: (and |v_ULTIMATE.start_lis_#t~short9_2| (< |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 2530#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 2531#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 2500#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 2501#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 2549#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 2495#L18-3 97.09/53.39 [2019-03-28 12:43:34,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.39 [2019-03-28 12:43:34,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1446440420, now seen corresponding path program 2 times 97.09/53.39 [2019-03-28 12:43:34,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.39 [2019-03-28 12:43:34,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.39 [2019-03-28 12:43:34,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:34,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:34,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.39 [2019-03-28 12:43:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.39 [2019-03-28 12:43:34,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.39 [2019-03-28 12:43:34,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1205360556, now seen corresponding path program 3 times 97.09/53.39 [2019-03-28 12:43:34,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.39 [2019-03-28 12:43:34,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.39 [2019-03-28 12:43:34,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:34,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:34,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.39 [2019-03-28 12:43:34,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 97.09/53.39 [2019-03-28 12:43:34,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 97.09/53.39 [2019-03-28 12:43:34,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 97.09/53.39 [2019-03-28 12:43:34,553 INFO L811 eck$LassoCheckResult]: loop already infeasible 97.09/53.39 [2019-03-28 12:43:34,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 97.09/53.39 [2019-03-28 12:43:34,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 97.09/53.39 [2019-03-28 12:43:34,553 INFO L87 Difference]: Start difference. First operand 56 states and 89 transitions. cyclomatic complexity: 37 Second operand 3 states. 97.09/53.39 [2019-03-28 12:43:34,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 97.09/53.39 [2019-03-28 12:43:34,598 INFO L93 Difference]: Finished difference Result 60 states and 93 transitions. 97.09/53.39 [2019-03-28 12:43:34,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 97.09/53.39 [2019-03-28 12:43:34,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 93 transitions. 97.09/53.39 [2019-03-28 12:43:34,604 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 97.09/53.39 [2019-03-28 12:43:34,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 93 transitions. 97.09/53.39 [2019-03-28 12:43:34,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 97.09/53.39 [2019-03-28 12:43:34,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 97.09/53.39 [2019-03-28 12:43:34,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 93 transitions. 97.09/53.39 [2019-03-28 12:43:34,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 97.09/53.39 [2019-03-28 12:43:34,605 INFO L706 BuchiCegarLoop]: Abstraction has 60 states and 93 transitions. 97.09/53.39 [2019-03-28 12:43:34,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 93 transitions. 97.09/53.39 [2019-03-28 12:43:34,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. 97.09/53.39 [2019-03-28 12:43:34,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. 97.09/53.39 [2019-03-28 12:43:34,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 93 transitions. 97.09/53.39 [2019-03-28 12:43:34,607 INFO L729 BuchiCegarLoop]: Abstraction has 60 states and 93 transitions. 97.09/53.39 [2019-03-28 12:43:34,607 INFO L609 BuchiCegarLoop]: Abstraction has 60 states and 93 transitions. 97.09/53.39 [2019-03-28 12:43:34,607 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ 97.09/53.39 [2019-03-28 12:43:34,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 93 transitions. 97.09/53.39 [2019-03-28 12:43:34,608 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 97.09/53.39 [2019-03-28 12:43:34,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 97.09/53.39 [2019-03-28 12:43:34,608 INFO L119 BuchiIsEmpty]: Starting construction of run 97.09/53.39 [2019-03-28 12:43:34,609 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] 97.09/53.39 [2019-03-28 12:43:34,609 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 97.09/53.39 [2019-03-28 12:43:34,609 INFO L794 eck$LassoCheckResult]: Stem: 2660#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 2658#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 2627#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 2628#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 2638#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 2676#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 2673#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 2640#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 2645#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 2639#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 2641#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 2617#L18-3 97.09/53.39 [2019-03-28 12:43:34,610 INFO L796 eck$LassoCheckResult]: Loop: 2617#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 2618#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 2656#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 2652#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 2653#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 2664#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 2622#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 2623#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 2675#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 2617#L18-3 97.09/53.39 [2019-03-28 12:43:34,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.39 [2019-03-28 12:43:34,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1446440420, now seen corresponding path program 3 times 97.09/53.39 [2019-03-28 12:43:34,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.39 [2019-03-28 12:43:34,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.39 [2019-03-28 12:43:34,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:34,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:34,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.39 [2019-03-28 12:43:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.39 [2019-03-28 12:43:34,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.39 [2019-03-28 12:43:34,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1176731405, now seen corresponding path program 1 times 97.09/53.39 [2019-03-28 12:43:34,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.39 [2019-03-28 12:43:34,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.39 [2019-03-28 12:43:34,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:34,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:34,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.39 [2019-03-28 12:43:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.39 [2019-03-28 12:43:34,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.39 [2019-03-28 12:43:34,630 INFO L82 PathProgramCache]: Analyzing trace with hash -270099144, now seen corresponding path program 1 times 97.09/53.39 [2019-03-28 12:43:34,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.39 [2019-03-28 12:43:34,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.39 [2019-03-28 12:43:34,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:34,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:34,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.39 [2019-03-28 12:43:34,703 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 97.09/53.39 [2019-03-28 12:43:34,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 97.09/53.39 [2019-03-28 12:43:34,704 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 97.09/53.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 97.09/53.39 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 97.09/53.39 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 97.09/53.39 [2019-03-28 12:43:34,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.39 [2019-03-28 12:43:34,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core 97.09/53.39 [2019-03-28 12:43:34,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... 97.09/53.39 [2019-03-28 12:43:34,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 97.09/53.39 [2019-03-28 12:43:34,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 97.09/53.39 [2019-03-28 12:43:34,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 97.09/53.39 [2019-03-28 12:43:34,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. 97.09/53.39 [2019-03-28 12:43:34,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 97.09/53.39 [2019-03-28 12:43:34,950 INFO L87 Difference]: Start difference. First operand 60 states and 93 transitions. cyclomatic complexity: 37 Second operand 14 states. 97.09/53.39 [2019-03-28 12:43:35,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 97.09/53.39 [2019-03-28 12:43:35,466 INFO L93 Difference]: Finished difference Result 197 states and 270 transitions. 97.09/53.39 [2019-03-28 12:43:35,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 97.09/53.39 [2019-03-28 12:43:35,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 197 states and 270 transitions. 97.09/53.39 [2019-03-28 12:43:35,473 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 67 97.09/53.39 [2019-03-28 12:43:35,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 197 states to 155 states and 212 transitions. 97.09/53.39 [2019-03-28 12:43:35,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 97.09/53.39 [2019-03-28 12:43:35,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 97.09/53.39 [2019-03-28 12:43:35,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 212 transitions. 97.09/53.39 [2019-03-28 12:43:35,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 97.09/53.39 [2019-03-28 12:43:35,475 INFO L706 BuchiCegarLoop]: Abstraction has 155 states and 212 transitions. 97.09/53.39 [2019-03-28 12:43:35,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 212 transitions. 97.09/53.39 [2019-03-28 12:43:35,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 70. 97.09/53.39 [2019-03-28 12:43:35,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. 97.09/53.39 [2019-03-28 12:43:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 99 transitions. 97.09/53.39 [2019-03-28 12:43:35,478 INFO L729 BuchiCegarLoop]: Abstraction has 70 states and 99 transitions. 97.09/53.39 [2019-03-28 12:43:35,478 INFO L609 BuchiCegarLoop]: Abstraction has 70 states and 99 transitions. 97.09/53.39 [2019-03-28 12:43:35,478 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ 97.09/53.39 [2019-03-28 12:43:35,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 99 transitions. 97.09/53.39 [2019-03-28 12:43:35,479 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 97.09/53.39 [2019-03-28 12:43:35,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 97.09/53.39 [2019-03-28 12:43:35,479 INFO L119 BuchiIsEmpty]: Starting construction of run 97.09/53.39 [2019-03-28 12:43:35,480 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] 97.09/53.39 [2019-03-28 12:43:35,480 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 97.09/53.39 [2019-03-28 12:43:35,480 INFO L794 eck$LassoCheckResult]: Stem: 3003#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 3002#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 2974#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 2975#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 2986#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 3019#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 2987#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 2988#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 2993#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 3014#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 3031#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 2970#L18-3 97.09/53.39 [2019-03-28 12:43:35,481 INFO L796 eck$LassoCheckResult]: Loop: 2970#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 3030#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 3029#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 3027#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 3025#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 3007#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 2969#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 2970#L18-3 97.09/53.39 [2019-03-28 12:43:35,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.39 [2019-03-28 12:43:35,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1446440420, now seen corresponding path program 4 times 97.09/53.39 [2019-03-28 12:43:35,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.39 [2019-03-28 12:43:35,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.39 [2019-03-28 12:43:35,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:35,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:35,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.39 [2019-03-28 12:43:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.39 [2019-03-28 12:43:35,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.39 [2019-03-28 12:43:35,496 INFO L82 PathProgramCache]: Analyzing trace with hash 266931631, now seen corresponding path program 1 times 97.09/53.39 [2019-03-28 12:43:35,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.39 [2019-03-28 12:43:35,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.39 [2019-03-28 12:43:35,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:35,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:35,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.39 [2019-03-28 12:43:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.39 [2019-03-28 12:43:35,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.39 [2019-03-28 12:43:35,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1273460532, now seen corresponding path program 1 times 97.09/53.39 [2019-03-28 12:43:35,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.39 [2019-03-28 12:43:35,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.39 [2019-03-28 12:43:35,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:35,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:35,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.39 [2019-03-28 12:43:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.39 [2019-03-28 12:43:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.39 [2019-03-28 12:43:36,376 WARN L188 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 116 97.09/53.39 [2019-03-28 12:43:36,554 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 98 97.09/53.39 [2019-03-28 12:43:36,556 INFO L216 LassoAnalysis]: Preferences: 97.09/53.39 [2019-03-28 12:43:36,556 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 97.09/53.39 [2019-03-28 12:43:36,556 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 97.09/53.39 [2019-03-28 12:43:36,556 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 97.09/53.39 [2019-03-28 12:43:36,556 INFO L127 ssoRankerPreferences]: Use exernal solver: false 97.09/53.39 [2019-03-28 12:43:36,557 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 97.09/53.39 [2019-03-28 12:43:36,557 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 97.09/53.39 [2019-03-28 12:43:36,557 INFO L130 ssoRankerPreferences]: Path of dumped script: 97.09/53.39 [2019-03-28 12:43:36,557 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration16_Lasso 97.09/53.39 [2019-03-28 12:43:36,557 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 97.09/53.39 [2019-03-28 12:43:36,557 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 97.09/53.39 [2019-03-28 12:43:36,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.39 [2019-03-28 12:43:36,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.39 [2019-03-28 12:43:36,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.39 [2019-03-28 12:43:36,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.39 [2019-03-28 12:43:36,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.39 [2019-03-28 12:43:36,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.39 [2019-03-28 12:43:36,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.39 [2019-03-28 12:43:36,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.39 [2019-03-28 12:43:36,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.39 [2019-03-28 12:43:36,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.39 [2019-03-28 12:43:36,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.39 [2019-03-28 12:43:36,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.39 [2019-03-28 12:43:36,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.39 [2019-03-28 12:43:36,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.39 [2019-03-28 12:43:36,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.39 [2019-03-28 12:43:37,029 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 97.09/53.39 [2019-03-28 12:43:37,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.39 [2019-03-28 12:43:37,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.39 [2019-03-28 12:43:37,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.39 [2019-03-28 12:43:37,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.39 [2019-03-28 12:43:37,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.39 [2019-03-28 12:43:37,306 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 97.09/53.39 [2019-03-28 12:43:37,536 INFO L300 LassoAnalysis]: Preprocessing complete. 97.09/53.39 [2019-03-28 12:43:37,536 INFO L497 LassoAnalysis]: Using template 'affine'. 97.09/53.39 [2019-03-28 12:43:37,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.39 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.39 Number of strict supporting invariants: 0 97.09/53.39 Number of non-strict supporting invariants: 1 97.09/53.39 Consider only non-deceasing supporting invariants: true 97.09/53.39 Simplify termination arguments: true 97.09/53.39 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.39 [2019-03-28 12:43:37,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.39 [2019-03-28 12:43:37,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.39 [2019-03-28 12:43:37,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.39 [2019-03-28 12:43:37,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.39 [2019-03-28 12:43:37,538 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.39 [2019-03-28 12:43:37,538 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.39 [2019-03-28 12:43:37,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.39 [2019-03-28 12:43:37,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.39 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.39 Number of strict supporting invariants: 0 97.09/53.39 Number of non-strict supporting invariants: 1 97.09/53.39 Consider only non-deceasing supporting invariants: true 97.09/53.39 Simplify termination arguments: true 97.09/53.39 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.39 [2019-03-28 12:43:37,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.39 [2019-03-28 12:43:37,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.39 [2019-03-28 12:43:37,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.39 [2019-03-28 12:43:37,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.39 [2019-03-28 12:43:37,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.39 [2019-03-28 12:43:37,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.39 [2019-03-28 12:43:37,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.39 [2019-03-28 12:43:37,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.39 [2019-03-28 12:43:37,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.39 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.39 Number of strict supporting invariants: 0 97.09/53.39 Number of non-strict supporting invariants: 1 97.09/53.39 Consider only non-deceasing supporting invariants: true 97.09/53.39 Simplify termination arguments: true 97.09/53.39 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.39 [2019-03-28 12:43:37,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.39 [2019-03-28 12:43:37,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.39 [2019-03-28 12:43:37,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.39 [2019-03-28 12:43:37,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.39 [2019-03-28 12:43:37,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.39 [2019-03-28 12:43:37,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.39 [2019-03-28 12:43:37,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.39 [2019-03-28 12:43:37,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.39 [2019-03-28 12:43:37,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.39 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.39 Number of strict supporting invariants: 0 97.09/53.39 Number of non-strict supporting invariants: 1 97.09/53.39 Consider only non-deceasing supporting invariants: true 97.09/53.39 Simplify termination arguments: true 97.09/53.39 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.39 [2019-03-28 12:43:37,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.39 [2019-03-28 12:43:37,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.39 [2019-03-28 12:43:37,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.39 [2019-03-28 12:43:37,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.39 [2019-03-28 12:43:37,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.39 [2019-03-28 12:43:37,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.39 [2019-03-28 12:43:37,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.39 [2019-03-28 12:43:37,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.39 [2019-03-28 12:43:37,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.39 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.39 Number of strict supporting invariants: 0 97.09/53.39 Number of non-strict supporting invariants: 1 97.09/53.39 Consider only non-deceasing supporting invariants: true 97.09/53.39 Simplify termination arguments: true 97.09/53.39 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.39 [2019-03-28 12:43:37,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.39 [2019-03-28 12:43:37,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.39 [2019-03-28 12:43:37,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.39 [2019-03-28 12:43:37,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.39 [2019-03-28 12:43:37,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.39 [2019-03-28 12:43:37,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.39 [2019-03-28 12:43:37,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.39 [2019-03-28 12:43:37,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.39 [2019-03-28 12:43:37,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.39 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.39 Number of strict supporting invariants: 0 97.09/53.39 Number of non-strict supporting invariants: 1 97.09/53.39 Consider only non-deceasing supporting invariants: true 97.09/53.39 Simplify termination arguments: true 97.09/53.39 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.39 [2019-03-28 12:43:37,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.39 [2019-03-28 12:43:37,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.39 [2019-03-28 12:43:37,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.39 [2019-03-28 12:43:37,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.39 [2019-03-28 12:43:37,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.39 [2019-03-28 12:43:37,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.39 [2019-03-28 12:43:37,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.39 [2019-03-28 12:43:37,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.39 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.39 Number of strict supporting invariants: 0 97.09/53.39 Number of non-strict supporting invariants: 1 97.09/53.39 Consider only non-deceasing supporting invariants: true 97.09/53.39 Simplify termination arguments: true 97.09/53.39 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.39 [2019-03-28 12:43:37,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.39 [2019-03-28 12:43:37,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.39 [2019-03-28 12:43:37,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.39 [2019-03-28 12:43:37,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.39 [2019-03-28 12:43:37,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.39 [2019-03-28 12:43:37,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.39 [2019-03-28 12:43:37,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.39 [2019-03-28 12:43:37,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.39 [2019-03-28 12:43:37,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.39 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.39 Number of strict supporting invariants: 0 97.09/53.39 Number of non-strict supporting invariants: 1 97.09/53.39 Consider only non-deceasing supporting invariants: true 97.09/53.39 Simplify termination arguments: true 97.09/53.39 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.39 [2019-03-28 12:43:37,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.39 [2019-03-28 12:43:37,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.39 [2019-03-28 12:43:37,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.39 [2019-03-28 12:43:37,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.39 [2019-03-28 12:43:37,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.39 [2019-03-28 12:43:37,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.39 [2019-03-28 12:43:37,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.39 [2019-03-28 12:43:37,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.39 [2019-03-28 12:43:37,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.39 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.39 Number of strict supporting invariants: 0 97.09/53.39 Number of non-strict supporting invariants: 1 97.09/53.39 Consider only non-deceasing supporting invariants: true 97.09/53.39 Simplify termination arguments: true 97.09/53.39 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.39 [2019-03-28 12:43:37,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.39 [2019-03-28 12:43:37,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.39 [2019-03-28 12:43:37,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.39 [2019-03-28 12:43:37,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.39 [2019-03-28 12:43:37,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.39 [2019-03-28 12:43:37,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.39 [2019-03-28 12:43:37,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.39 [2019-03-28 12:43:37,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.39 [2019-03-28 12:43:37,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.39 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.39 Number of strict supporting invariants: 0 97.09/53.39 Number of non-strict supporting invariants: 1 97.09/53.39 Consider only non-deceasing supporting invariants: true 97.09/53.39 Simplify termination arguments: true 97.09/53.39 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.39 [2019-03-28 12:43:37,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.39 [2019-03-28 12:43:37,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.39 [2019-03-28 12:43:37,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.39 [2019-03-28 12:43:37,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.39 [2019-03-28 12:43:37,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.39 [2019-03-28 12:43:37,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.39 [2019-03-28 12:43:37,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.39 [2019-03-28 12:43:37,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.39 [2019-03-28 12:43:37,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.39 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.39 Number of strict supporting invariants: 0 97.09/53.39 Number of non-strict supporting invariants: 1 97.09/53.39 Consider only non-deceasing supporting invariants: true 97.09/53.39 Simplify termination arguments: true 97.09/53.39 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.39 [2019-03-28 12:43:37,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.39 [2019-03-28 12:43:37,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.39 [2019-03-28 12:43:37,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.39 [2019-03-28 12:43:37,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.39 [2019-03-28 12:43:37,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.39 [2019-03-28 12:43:37,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.39 [2019-03-28 12:43:37,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.39 [2019-03-28 12:43:37,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.39 [2019-03-28 12:43:37,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.39 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.39 Number of strict supporting invariants: 0 97.09/53.39 Number of non-strict supporting invariants: 1 97.09/53.39 Consider only non-deceasing supporting invariants: true 97.09/53.39 Simplify termination arguments: true 97.09/53.39 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.39 [2019-03-28 12:43:37,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.39 [2019-03-28 12:43:37,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.39 [2019-03-28 12:43:37,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.39 [2019-03-28 12:43:37,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.39 [2019-03-28 12:43:37,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.39 [2019-03-28 12:43:37,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.39 [2019-03-28 12:43:37,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.39 [2019-03-28 12:43:37,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.39 [2019-03-28 12:43:37,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.39 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.39 Number of strict supporting invariants: 0 97.09/53.39 Number of non-strict supporting invariants: 1 97.09/53.39 Consider only non-deceasing supporting invariants: true 97.09/53.39 Simplify termination arguments: true 97.09/53.39 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.39 [2019-03-28 12:43:37,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.39 [2019-03-28 12:43:37,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.39 [2019-03-28 12:43:37,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.39 [2019-03-28 12:43:37,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.39 [2019-03-28 12:43:37,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.39 [2019-03-28 12:43:37,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.39 [2019-03-28 12:43:37,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.39 [2019-03-28 12:43:37,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.39 [2019-03-28 12:43:37,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.39 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.39 Number of strict supporting invariants: 0 97.09/53.39 Number of non-strict supporting invariants: 1 97.09/53.39 Consider only non-deceasing supporting invariants: true 97.09/53.39 Simplify termination arguments: true 97.09/53.39 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.39 [2019-03-28 12:43:37,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.39 [2019-03-28 12:43:37,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.39 [2019-03-28 12:43:37,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.39 [2019-03-28 12:43:37,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.39 [2019-03-28 12:43:37,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.39 [2019-03-28 12:43:37,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.39 [2019-03-28 12:43:37,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.39 [2019-03-28 12:43:37,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.39 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.39 Number of strict supporting invariants: 0 97.09/53.39 Number of non-strict supporting invariants: 1 97.09/53.39 Consider only non-deceasing supporting invariants: true 97.09/53.39 Simplify termination arguments: true 97.09/53.39 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.39 [2019-03-28 12:43:37,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.39 [2019-03-28 12:43:37,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.39 [2019-03-28 12:43:37,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.39 [2019-03-28 12:43:37,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.39 [2019-03-28 12:43:37,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.39 [2019-03-28 12:43:37,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.39 [2019-03-28 12:43:37,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.39 [2019-03-28 12:43:37,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.39 [2019-03-28 12:43:37,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.39 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.39 Number of strict supporting invariants: 0 97.09/53.39 Number of non-strict supporting invariants: 1 97.09/53.39 Consider only non-deceasing supporting invariants: true 97.09/53.39 Simplify termination arguments: true 97.09/53.39 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.39 [2019-03-28 12:43:37,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.39 [2019-03-28 12:43:37,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.39 [2019-03-28 12:43:37,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.39 [2019-03-28 12:43:37,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.39 [2019-03-28 12:43:37,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.39 [2019-03-28 12:43:37,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.39 [2019-03-28 12:43:37,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.39 [2019-03-28 12:43:37,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.39 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.39 Number of strict supporting invariants: 0 97.09/53.39 Number of non-strict supporting invariants: 1 97.09/53.39 Consider only non-deceasing supporting invariants: true 97.09/53.39 Simplify termination arguments: true 97.09/53.39 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.39 [2019-03-28 12:43:37,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.39 [2019-03-28 12:43:37,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.39 [2019-03-28 12:43:37,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.39 [2019-03-28 12:43:37,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.39 [2019-03-28 12:43:37,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.39 [2019-03-28 12:43:37,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.39 [2019-03-28 12:43:37,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.39 [2019-03-28 12:43:37,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.39 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.39 Number of strict supporting invariants: 0 97.09/53.39 Number of non-strict supporting invariants: 1 97.09/53.39 Consider only non-deceasing supporting invariants: true 97.09/53.39 Simplify termination arguments: true 97.09/53.39 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.39 [2019-03-28 12:43:37,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.39 [2019-03-28 12:43:37,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.39 [2019-03-28 12:43:37,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.39 [2019-03-28 12:43:37,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.39 [2019-03-28 12:43:37,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.39 [2019-03-28 12:43:37,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.39 [2019-03-28 12:43:37,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.39 [2019-03-28 12:43:37,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.39 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.39 Number of strict supporting invariants: 0 97.09/53.39 Number of non-strict supporting invariants: 1 97.09/53.39 Consider only non-deceasing supporting invariants: true 97.09/53.39 Simplify termination arguments: true 97.09/53.39 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.39 [2019-03-28 12:43:37,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.39 [2019-03-28 12:43:37,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.39 [2019-03-28 12:43:37,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.39 [2019-03-28 12:43:37,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.39 [2019-03-28 12:43:37,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.39 [2019-03-28 12:43:37,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.39 [2019-03-28 12:43:37,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.39 [2019-03-28 12:43:37,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.39 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.39 Number of strict supporting invariants: 0 97.09/53.39 Number of non-strict supporting invariants: 1 97.09/53.39 Consider only non-deceasing supporting invariants: true 97.09/53.39 Simplify termination arguments: true 97.09/53.39 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.39 [2019-03-28 12:43:37,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.39 [2019-03-28 12:43:37,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.39 [2019-03-28 12:43:37,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.39 [2019-03-28 12:43:37,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.39 [2019-03-28 12:43:37,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.39 [2019-03-28 12:43:37,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.39 [2019-03-28 12:43:37,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.39 [2019-03-28 12:43:37,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.39 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.39 Number of strict supporting invariants: 0 97.09/53.39 Number of non-strict supporting invariants: 1 97.09/53.39 Consider only non-deceasing supporting invariants: true 97.09/53.39 Simplify termination arguments: true 97.09/53.39 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.39 [2019-03-28 12:43:37,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.39 [2019-03-28 12:43:37,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.39 [2019-03-28 12:43:37,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.39 [2019-03-28 12:43:37,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.39 [2019-03-28 12:43:37,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.39 [2019-03-28 12:43:37,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.39 [2019-03-28 12:43:37,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.39 [2019-03-28 12:43:37,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.39 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.39 Number of strict supporting invariants: 0 97.09/53.39 Number of non-strict supporting invariants: 1 97.09/53.39 Consider only non-deceasing supporting invariants: true 97.09/53.39 Simplify termination arguments: true 97.09/53.39 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.39 [2019-03-28 12:43:37,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.39 [2019-03-28 12:43:37,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.39 [2019-03-28 12:43:37,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.39 [2019-03-28 12:43:37,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.39 [2019-03-28 12:43:37,583 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.39 [2019-03-28 12:43:37,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.39 [2019-03-28 12:43:37,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.39 [2019-03-28 12:43:37,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.39 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.39 Number of strict supporting invariants: 0 97.09/53.39 Number of non-strict supporting invariants: 1 97.09/53.39 Consider only non-deceasing supporting invariants: true 97.09/53.39 Simplify termination arguments: true 97.09/53.39 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.39 [2019-03-28 12:43:37,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.39 [2019-03-28 12:43:37,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.39 [2019-03-28 12:43:37,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.39 [2019-03-28 12:43:37,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.39 [2019-03-28 12:43:37,589 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.39 [2019-03-28 12:43:37,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.39 [2019-03-28 12:43:37,601 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 97.09/53.39 [2019-03-28 12:43:37,610 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 97.09/53.39 [2019-03-28 12:43:37,611 INFO L444 ModelExtractionUtils]: 45 out of 49 variables were initially zero. Simplification set additionally 1 variables to zero. 97.09/53.39 [2019-03-28 12:43:37,611 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 97.09/53.39 [2019-03-28 12:43:37,612 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 97.09/53.39 [2019-03-28 12:43:37,612 INFO L518 LassoAnalysis]: Proved termination. 97.09/53.39 [2019-03-28 12:43:37,612 INFO L520 LassoAnalysis]: Termination argument consisting of: 97.09/53.39 Ranking function f(ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_~i~0) = -1*ULTIMATE.start_lis_~j~0 + 1*ULTIMATE.start_lis_~i~0 97.09/53.39 Supporting invariants [] 97.09/53.39 [2019-03-28 12:43:37,689 INFO L297 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed 97.09/53.39 [2019-03-28 12:43:37,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.39 [2019-03-28 12:43:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:43:37,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core 97.09/53.40 [2019-03-28 12:43:37,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... 97.09/53.40 [2019-03-28 12:43:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:43:37,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core 97.09/53.40 [2019-03-28 12:43:37,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... 97.09/53.40 [2019-03-28 12:43:37,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 97.09/53.40 [2019-03-28 12:43:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:43:37,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core 97.09/53.40 [2019-03-28 12:43:37,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... 97.09/53.40 [2019-03-28 12:43:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:43:37,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core 97.09/53.40 [2019-03-28 12:43:37,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... 97.09/53.40 [2019-03-28 12:43:37,803 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 97.09/53.40 [2019-03-28 12:43:37,803 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 97.09/53.40 [2019-03-28 12:43:37,803 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 70 states and 99 transitions. cyclomatic complexity: 34 Second operand 3 states. 97.09/53.40 [2019-03-28 12:43:37,873 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 70 states and 99 transitions. cyclomatic complexity: 34. Second operand 3 states. Result 113 states and 157 transitions. Complement of second has 4 states. 97.09/53.40 [2019-03-28 12:43:37,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 97.09/53.40 [2019-03-28 12:43:37,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 97.09/53.40 [2019-03-28 12:43:37,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. 97.09/53.40 [2019-03-28 12:43:37,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 11 letters. Loop has 7 letters. 97.09/53.40 [2019-03-28 12:43:37,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. 97.09/53.40 [2019-03-28 12:43:37,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 18 letters. Loop has 7 letters. 97.09/53.40 [2019-03-28 12:43:37,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. 97.09/53.40 [2019-03-28 12:43:37,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 11 letters. Loop has 14 letters. 97.09/53.40 [2019-03-28 12:43:37,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. 97.09/53.40 [2019-03-28 12:43:37,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 157 transitions. 97.09/53.40 [2019-03-28 12:43:37,880 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 97.09/53.40 [2019-03-28 12:43:37,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 54 states and 78 transitions. 97.09/53.40 [2019-03-28 12:43:37,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 97.09/53.40 [2019-03-28 12:43:37,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 97.09/53.40 [2019-03-28 12:43:37,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 78 transitions. 97.09/53.40 [2019-03-28 12:43:37,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 97.09/53.40 [2019-03-28 12:43:37,882 INFO L706 BuchiCegarLoop]: Abstraction has 54 states and 78 transitions. 97.09/53.40 [2019-03-28 12:43:37,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 78 transitions. 97.09/53.40 [2019-03-28 12:43:37,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. 97.09/53.40 [2019-03-28 12:43:37,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. 97.09/53.40 [2019-03-28 12:43:37,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. 97.09/53.40 [2019-03-28 12:43:37,884 INFO L729 BuchiCegarLoop]: Abstraction has 54 states and 78 transitions. 97.09/53.40 [2019-03-28 12:43:37,884 INFO L609 BuchiCegarLoop]: Abstraction has 54 states and 78 transitions. 97.09/53.40 [2019-03-28 12:43:37,884 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ 97.09/53.40 [2019-03-28 12:43:37,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 78 transitions. 97.09/53.40 [2019-03-28 12:43:37,886 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 97.09/53.40 [2019-03-28 12:43:37,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 97.09/53.40 [2019-03-28 12:43:37,886 INFO L119 BuchiIsEmpty]: Starting construction of run 97.09/53.40 [2019-03-28 12:43:37,886 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 1, 1, 1, 1, 1] 97.09/53.40 [2019-03-28 12:43:37,887 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 97.09/53.40 [2019-03-28 12:43:37,887 INFO L794 eck$LassoCheckResult]: Stem: 3392#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 3391#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 3372#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 3373#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 3381#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 3417#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 3382#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 3383#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 3384#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 3398#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 3415#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 3416#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 3414#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 3396#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 3364#L18-3 97.09/53.40 [2019-03-28 12:43:37,888 INFO L796 eck$LassoCheckResult]: Loop: 3364#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 3365#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 3413#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 3412#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 3405#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 3403#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 3401#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 3400#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 3399#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 3364#L18-3 97.09/53.40 [2019-03-28 12:43:37,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.40 [2019-03-28 12:43:37,888 INFO L82 PathProgramCache]: Analyzing trace with hash 365088201, now seen corresponding path program 5 times 97.09/53.40 [2019-03-28 12:43:37,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.40 [2019-03-28 12:43:37,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.40 [2019-03-28 12:43:37,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:37,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:37,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:37,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.40 [2019-03-28 12:43:37,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1176731405, now seen corresponding path program 2 times 97.09/53.40 [2019-03-28 12:43:37,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.40 [2019-03-28 12:43:37,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.40 [2019-03-28 12:43:37,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:37,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:37,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:37,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.40 [2019-03-28 12:43:37,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1487883221, now seen corresponding path program 2 times 97.09/53.40 [2019-03-28 12:43:37,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.40 [2019-03-28 12:43:37,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.40 [2019-03-28 12:43:37,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:37,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:37,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:39,295 WARN L188 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 159 DAG size of output: 132 97.09/53.40 [2019-03-28 12:43:39,670 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 108 97.09/53.40 [2019-03-28 12:43:39,672 INFO L216 LassoAnalysis]: Preferences: 97.09/53.40 [2019-03-28 12:43:39,677 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 97.09/53.40 [2019-03-28 12:43:39,677 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 97.09/53.40 [2019-03-28 12:43:39,677 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 97.09/53.40 [2019-03-28 12:43:39,678 INFO L127 ssoRankerPreferences]: Use exernal solver: false 97.09/53.40 [2019-03-28 12:43:39,678 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 97.09/53.40 [2019-03-28 12:43:39,678 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 97.09/53.40 [2019-03-28 12:43:39,678 INFO L130 ssoRankerPreferences]: Path of dumped script: 97.09/53.40 [2019-03-28 12:43:39,678 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration17_Lasso 97.09/53.40 [2019-03-28 12:43:39,678 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 97.09/53.40 [2019-03-28 12:43:39,678 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 97.09/53.40 [2019-03-28 12:43:39,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:39,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:39,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:39,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:39,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:40,247 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 97.09/53.40 [2019-03-28 12:43:40,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:40,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:40,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:40,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:40,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:40,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:40,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:40,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:40,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:40,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:40,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:40,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:40,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:40,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:40,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:40,591 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 97.09/53.40 [2019-03-28 12:43:40,811 INFO L300 LassoAnalysis]: Preprocessing complete. 97.09/53.40 [2019-03-28 12:43:40,811 INFO L497 LassoAnalysis]: Using template 'affine'. 97.09/53.40 [2019-03-28 12:43:40,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:40,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:40,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.40 [2019-03-28 12:43:40,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:40,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:40,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:40,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:40,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:40,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:40,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:40,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:40,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.40 [2019-03-28 12:43:40,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:40,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:40,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:40,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:40,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:40,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:40,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:40,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:40,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:40,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:40,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:40,816 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:40,816 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:40,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:40,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:40,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:40,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.40 [2019-03-28 12:43:40,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:40,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:40,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:40,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:40,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:40,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:40,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:40,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:40,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:40,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:40,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:40,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:40,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:40,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:40,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:40,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:40,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:40,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:40,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:40,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:40,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:40,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:40,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:40,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:40,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:40,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:40,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:40,827 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:40,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:40,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:40,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:40,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:40,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:40,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:40,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:40,830 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:40,830 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:40,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:40,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:40,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:40,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:40,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:40,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:40,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:40,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:40,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:40,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:40,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:40,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:40,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:40,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:40,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:40,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:40,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:40,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:40,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:40,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:40,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:40,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:40,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:40,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:40,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:40,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:40,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:40,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:40,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:40,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:40,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:40,840 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:40,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:40,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:40,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:40,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:40,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:40,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:40,843 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:40,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:40,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:40,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:40,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:40,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.40 [2019-03-28 12:43:40,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:40,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:40,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:40,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:40,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:40,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:40,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:40,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:40,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:40,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:40,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:40,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:40,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:40,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:40,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:40,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:40,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:40,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:40,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:40,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:40,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:40,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:40,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:40,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:40,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:40,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:40,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:40,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:40,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:40,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:40,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:40,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:40,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:40,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:40,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:40,858 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:40,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:40,875 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 97.09/53.40 [2019-03-28 12:43:40,894 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 97.09/53.40 [2019-03-28 12:43:40,894 INFO L444 ModelExtractionUtils]: 46 out of 52 variables were initially zero. Simplification set additionally 3 variables to zero. 97.09/53.40 [2019-03-28 12:43:40,894 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 97.09/53.40 [2019-03-28 12:43:40,895 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 97.09/53.40 [2019-03-28 12:43:40,895 INFO L518 LassoAnalysis]: Proved termination. 97.09/53.40 [2019-03-28 12:43:40,895 INFO L520 LassoAnalysis]: Termination argument consisting of: 97.09/53.40 Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N 97.09/53.40 Supporting invariants [] 97.09/53.40 [2019-03-28 12:43:40,994 INFO L297 tatePredicateManager]: 31 out of 31 supporting invariants were superfluous and have been removed 97.09/53.40 [2019-03-28 12:43:41,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.40 [2019-03-28 12:43:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:43:41,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core 97.09/53.40 [2019-03-28 12:43:41,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... 97.09/53.40 [2019-03-28 12:43:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:43:41,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core 97.09/53.40 [2019-03-28 12:43:41,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... 97.09/53.40 [2019-03-28 12:43:41,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 97.09/53.40 [2019-03-28 12:43:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:43:41,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core 97.09/53.40 [2019-03-28 12:43:41,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... 97.09/53.40 [2019-03-28 12:43:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:43:41,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core 97.09/53.40 [2019-03-28 12:43:41,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... 97.09/53.40 [2019-03-28 12:43:41,127 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 97.09/53.40 [2019-03-28 12:43:41,127 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 97.09/53.40 [2019-03-28 12:43:41,128 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 54 states and 78 transitions. cyclomatic complexity: 28 Second operand 4 states. 97.09/53.40 [2019-03-28 12:43:41,200 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 54 states and 78 transitions. cyclomatic complexity: 28. Second operand 4 states. Result 92 states and 131 transitions. Complement of second has 7 states. 97.09/53.40 [2019-03-28 12:43:41,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states 97.09/53.40 [2019-03-28 12:43:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 97.09/53.40 [2019-03-28 12:43:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. 97.09/53.40 [2019-03-28 12:43:41,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 14 letters. Loop has 9 letters. 97.09/53.40 [2019-03-28 12:43:41,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. 97.09/53.40 [2019-03-28 12:43:41,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 23 letters. Loop has 9 letters. 97.09/53.40 [2019-03-28 12:43:41,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. 97.09/53.40 [2019-03-28 12:43:41,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 14 letters. Loop has 18 letters. 97.09/53.40 [2019-03-28 12:43:41,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. 97.09/53.40 [2019-03-28 12:43:41,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 131 transitions. 97.09/53.40 [2019-03-28 12:43:41,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 97.09/53.40 [2019-03-28 12:43:41,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 58 states and 83 transitions. 97.09/53.40 [2019-03-28 12:43:41,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 97.09/53.40 [2019-03-28 12:43:41,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 97.09/53.40 [2019-03-28 12:43:41,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 83 transitions. 97.09/53.40 [2019-03-28 12:43:41,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 97.09/53.40 [2019-03-28 12:43:41,210 INFO L706 BuchiCegarLoop]: Abstraction has 58 states and 83 transitions. 97.09/53.40 [2019-03-28 12:43:41,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 83 transitions. 97.09/53.40 [2019-03-28 12:43:41,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. 97.09/53.40 [2019-03-28 12:43:41,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. 97.09/53.40 [2019-03-28 12:43:41,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. 97.09/53.40 [2019-03-28 12:43:41,212 INFO L729 BuchiCegarLoop]: Abstraction has 55 states and 79 transitions. 97.09/53.40 [2019-03-28 12:43:41,212 INFO L609 BuchiCegarLoop]: Abstraction has 55 states and 79 transitions. 97.09/53.40 [2019-03-28 12:43:41,212 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ 97.09/53.40 [2019-03-28 12:43:41,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 79 transitions. 97.09/53.40 [2019-03-28 12:43:41,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 97.09/53.40 [2019-03-28 12:43:41,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 97.09/53.40 [2019-03-28 12:43:41,213 INFO L119 BuchiIsEmpty]: Starting construction of run 97.09/53.40 [2019-03-28 12:43:41,214 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] 97.09/53.40 [2019-03-28 12:43:41,214 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 97.09/53.40 [2019-03-28 12:43:41,215 INFO L794 eck$LassoCheckResult]: Stem: 3808#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 3807#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 3786#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 3787#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 3795#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 3800#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 3796#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 3797#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 3819#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 3818#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 3816#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 3817#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 3815#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 3812#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 3813#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 3820#L17-3 [282] L17-3-->L22-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_10 v_ULTIMATE.start_lis_~i~0_41) (= 0 v_ULTIMATE.start_lis_~i~0_40)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_41, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_40, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 3789#L22-3 97.09/53.40 [2019-03-28 12:43:41,215 INFO L796 eck$LassoCheckResult]: Loop: 3789#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 3790#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 3793#L23-1 [208] L23-1-->L22-2: Formula: (>= v_ULTIMATE.start_lis_~max~0_5 |v_ULTIMATE.start_lis_#t~mem12_6|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_6|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_5|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 3791#L22-2 [130] L22-2-->L22-3: Formula: (= (+ v_ULTIMATE.start_lis_~i~0_35 1) v_ULTIMATE.start_lis_~i~0_34) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_35} OutVars{ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_2|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_34} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post11] 3789#L22-3 97.09/53.40 [2019-03-28 12:43:41,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.40 [2019-03-28 12:43:41,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1337548056, now seen corresponding path program 1 times 97.09/53.40 [2019-03-28 12:43:41,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.40 [2019-03-28 12:43:41,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.40 [2019-03-28 12:43:41,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:41,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:41,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:43:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 97.09/53.40 [2019-03-28 12:43:41,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 97.09/53.40 [2019-03-28 12:43:41,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 97.09/53.40 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 97.09/53.40 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 97.09/53.40 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 97.09/53.40 [2019-03-28 12:43:41,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:43:41,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjunts are in the unsatisfiable core 97.09/53.40 [2019-03-28 12:43:41,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... 97.09/53.40 [2019-03-28 12:43:41,336 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. 97.09/53.40 [2019-03-28 12:43:41,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 97.09/53.40 [2019-03-28 12:43:41,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 97.09/53.40 [2019-03-28 12:43:41,363 INFO L799 eck$LassoCheckResult]: stem already infeasible 97.09/53.40 [2019-03-28 12:43:41,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.40 [2019-03-28 12:43:41,363 INFO L82 PathProgramCache]: Analyzing trace with hash 4943235, now seen corresponding path program 3 times 97.09/53.40 [2019-03-28 12:43:41,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.40 [2019-03-28 12:43:41,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.40 [2019-03-28 12:43:41,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:41,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:41,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:41,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. 97.09/53.40 [2019-03-28 12:43:41,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 97.09/53.40 [2019-03-28 12:43:41,393 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. cyclomatic complexity: 28 Second operand 12 states. 97.09/53.40 [2019-03-28 12:43:41,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 97.09/53.40 [2019-03-28 12:43:41,742 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. 97.09/53.40 [2019-03-28 12:43:41,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 97.09/53.40 [2019-03-28 12:43:41,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 166 transitions. 97.09/53.40 [2019-03-28 12:43:41,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 97.09/53.40 [2019-03-28 12:43:41,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 77 states and 103 transitions. 97.09/53.40 [2019-03-28 12:43:41,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 97.09/53.40 [2019-03-28 12:43:41,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 97.09/53.40 [2019-03-28 12:43:41,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 103 transitions. 97.09/53.40 [2019-03-28 12:43:41,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 97.09/53.40 [2019-03-28 12:43:41,750 INFO L706 BuchiCegarLoop]: Abstraction has 77 states and 103 transitions. 97.09/53.40 [2019-03-28 12:43:41,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 103 transitions. 97.09/53.40 [2019-03-28 12:43:41,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 53. 97.09/53.40 [2019-03-28 12:43:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. 97.09/53.40 [2019-03-28 12:43:41,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. 97.09/53.40 [2019-03-28 12:43:41,752 INFO L729 BuchiCegarLoop]: Abstraction has 53 states and 73 transitions. 97.09/53.40 [2019-03-28 12:43:41,752 INFO L609 BuchiCegarLoop]: Abstraction has 53 states and 73 transitions. 97.09/53.40 [2019-03-28 12:43:41,752 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ 97.09/53.40 [2019-03-28 12:43:41,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 73 transitions. 97.09/53.40 [2019-03-28 12:43:41,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 97.09/53.40 [2019-03-28 12:43:41,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 97.09/53.40 [2019-03-28 12:43:41,753 INFO L119 BuchiIsEmpty]: Starting construction of run 97.09/53.40 [2019-03-28 12:43:41,753 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] 97.09/53.40 [2019-03-28 12:43:41,753 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 97.09/53.40 [2019-03-28 12:43:41,754 INFO L794 eck$LassoCheckResult]: Stem: 4069#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 4068#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 4049#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 4050#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 4058#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 4063#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 4059#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 4060#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 4079#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 4078#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 4076#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 4077#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 4075#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 4073#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 4042#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 4043#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 4094#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 4091#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 4087#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 4084#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 4082#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 4081#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 4074#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 4044#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 4045#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 4067#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 4065#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 4066#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 4072#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 4046#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 4047#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 4080#L17-3 [282] L17-3-->L22-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_10 v_ULTIMATE.start_lis_~i~0_41) (= 0 v_ULTIMATE.start_lis_~i~0_40)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_41, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_40, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 4052#L22-3 97.09/53.40 [2019-03-28 12:43:41,755 INFO L796 eck$LassoCheckResult]: Loop: 4052#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 4053#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 4056#L23-1 [208] L23-1-->L22-2: Formula: (>= v_ULTIMATE.start_lis_~max~0_5 |v_ULTIMATE.start_lis_#t~mem12_6|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_6|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_5|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 4055#L22-2 [130] L22-2-->L22-3: Formula: (= (+ v_ULTIMATE.start_lis_~i~0_35 1) v_ULTIMATE.start_lis_~i~0_34) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_35} OutVars{ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_2|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_34} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post11] 4052#L22-3 97.09/53.40 [2019-03-28 12:43:41,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.40 [2019-03-28 12:43:41,755 INFO L82 PathProgramCache]: Analyzing trace with hash 69393508, now seen corresponding path program 1 times 97.09/53.40 [2019-03-28 12:43:41,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.40 [2019-03-28 12:43:41,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.40 [2019-03-28 12:43:41,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:41,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:41,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:43:41,831 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. 97.09/53.40 [2019-03-28 12:43:41,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 97.09/53.40 [2019-03-28 12:43:41,831 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 97.09/53.40 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 97.09/53.40 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 97.09/53.40 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 97.09/53.40 [2019-03-28 12:43:41,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:43:41,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjunts are in the unsatisfiable core 97.09/53.40 [2019-03-28 12:43:41,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... 97.09/53.40 [2019-03-28 12:43:41,907 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. 97.09/53.40 [2019-03-28 12:43:41,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 97.09/53.40 [2019-03-28 12:43:41,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 97.09/53.40 [2019-03-28 12:43:41,936 INFO L799 eck$LassoCheckResult]: stem already infeasible 97.09/53.40 [2019-03-28 12:43:41,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.40 [2019-03-28 12:43:41,936 INFO L82 PathProgramCache]: Analyzing trace with hash 4943235, now seen corresponding path program 4 times 97.09/53.40 [2019-03-28 12:43:41,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.40 [2019-03-28 12:43:41,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.40 [2019-03-28 12:43:41,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:41,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:41,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:41,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. 97.09/53.40 [2019-03-28 12:43:41,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 97.09/53.40 [2019-03-28 12:43:41,967 INFO L87 Difference]: Start difference. First operand 53 states and 73 transitions. cyclomatic complexity: 24 Second operand 13 states. 97.09/53.40 [2019-03-28 12:43:42,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 97.09/53.40 [2019-03-28 12:43:42,176 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. 97.09/53.40 [2019-03-28 12:43:42,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 97.09/53.40 [2019-03-28 12:43:42,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 110 transitions. 97.09/53.40 [2019-03-28 12:43:42,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 97.09/53.40 [2019-03-28 12:43:42,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 82 states and 110 transitions. 97.09/53.40 [2019-03-28 12:43:42,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 97.09/53.40 [2019-03-28 12:43:42,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 97.09/53.40 [2019-03-28 12:43:42,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 110 transitions. 97.09/53.40 [2019-03-28 12:43:42,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 97.09/53.40 [2019-03-28 12:43:42,183 INFO L706 BuchiCegarLoop]: Abstraction has 82 states and 110 transitions. 97.09/53.40 [2019-03-28 12:43:42,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 110 transitions. 97.09/53.40 [2019-03-28 12:43:42,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. 97.09/53.40 [2019-03-28 12:43:42,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. 97.09/53.40 [2019-03-28 12:43:42,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. 97.09/53.40 [2019-03-28 12:43:42,185 INFO L729 BuchiCegarLoop]: Abstraction has 68 states and 92 transitions. 97.09/53.40 [2019-03-28 12:43:42,185 INFO L609 BuchiCegarLoop]: Abstraction has 68 states and 92 transitions. 97.09/53.40 [2019-03-28 12:43:42,185 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ 97.09/53.40 [2019-03-28 12:43:42,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 92 transitions. 97.09/53.40 [2019-03-28 12:43:42,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 97.09/53.40 [2019-03-28 12:43:42,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 97.09/53.40 [2019-03-28 12:43:42,186 INFO L119 BuchiIsEmpty]: Starting construction of run 97.09/53.40 [2019-03-28 12:43:42,187 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] 97.09/53.40 [2019-03-28 12:43:42,187 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 97.09/53.40 [2019-03-28 12:43:42,188 INFO L794 eck$LassoCheckResult]: Stem: 4319#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 4318#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 4298#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 4299#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 4307#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 4312#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 4308#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 4309#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 4347#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 4346#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 4344#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 4345#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 4343#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 4323#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 4292#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 4293#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 4342#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 4339#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 4335#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 4332#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 4329#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 4327#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 4324#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 4325#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 4359#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 4358#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 4314#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 4315#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 4322#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 4296#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 4294#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 4295#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 4316#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 4317#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 4352#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 4349#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 4330#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 4328#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 4326#L17-3 [282] L17-3-->L22-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_10 v_ULTIMATE.start_lis_~i~0_41) (= 0 v_ULTIMATE.start_lis_~i~0_40)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_41, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_40, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 4301#L22-3 97.09/53.40 [2019-03-28 12:43:42,188 INFO L796 eck$LassoCheckResult]: Loop: 4301#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 4302#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 4305#L23-1 [208] L23-1-->L22-2: Formula: (>= v_ULTIMATE.start_lis_~max~0_5 |v_ULTIMATE.start_lis_#t~mem12_6|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_6|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_5|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 4304#L22-2 [130] L22-2-->L22-3: Formula: (= (+ v_ULTIMATE.start_lis_~i~0_35 1) v_ULTIMATE.start_lis_~i~0_34) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_35} OutVars{ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_2|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_34} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post11] 4301#L22-3 97.09/53.40 [2019-03-28 12:43:42,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.40 [2019-03-28 12:43:42,189 INFO L82 PathProgramCache]: Analyzing trace with hash -133949558, now seen corresponding path program 2 times 97.09/53.40 [2019-03-28 12:43:42,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.40 [2019-03-28 12:43:42,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.40 [2019-03-28 12:43:42,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:42,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:42,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:42,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.40 [2019-03-28 12:43:42,212 INFO L82 PathProgramCache]: Analyzing trace with hash 4943235, now seen corresponding path program 5 times 97.09/53.40 [2019-03-28 12:43:42,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.40 [2019-03-28 12:43:42,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.40 [2019-03-28 12:43:42,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:42,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:42,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:42,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.40 [2019-03-28 12:43:42,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1577674612, now seen corresponding path program 1 times 97.09/53.40 [2019-03-28 12:43:42,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.40 [2019-03-28 12:43:42,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.40 [2019-03-28 12:43:42,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:42,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:42,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:43:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. 97.09/53.40 [2019-03-28 12:43:42,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 97.09/53.40 [2019-03-28 12:43:42,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 97.09/53.40 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 97.09/53.40 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 97.09/53.40 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 97.09/53.40 [2019-03-28 12:43:42,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:43:42,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 21 conjunts are in the unsatisfiable core 97.09/53.40 [2019-03-28 12:43:42,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... 97.09/53.40 [2019-03-28 12:43:42,541 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 97.09/53.40 [2019-03-28 12:43:42,542 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:42,548 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 97.09/53.40 [2019-03-28 12:43:42,548 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:42,548 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:11 97.09/53.40 [2019-03-28 12:43:42,563 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 15 treesize of output 11 97.09/53.40 [2019-03-28 12:43:42,564 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:42,570 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 97.09/53.40 [2019-03-28 12:43:42,571 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:42,571 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 97.09/53.40 [2019-03-28 12:43:42,592 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 97.09/53.40 [2019-03-28 12:43:42,593 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:42,601 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 97.09/53.40 [2019-03-28 12:43:42,602 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:42,602 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 97.09/53.40 [2019-03-28 12:43:42,635 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 97.09/53.40 [2019-03-28 12:43:42,635 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 56 97.09/53.40 [2019-03-28 12:43:42,636 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:42,661 INFO L497 ElimStorePlain]: treesize reduction 24, result has 60.0 percent of original size 97.09/53.40 [2019-03-28 12:43:42,661 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:42,662 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 97.09/53.40 [2019-03-28 12:43:42,734 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 97.09/53.40 [2019-03-28 12:43:42,735 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 82 97.09/53.40 [2019-03-28 12:43:42,735 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:42,770 INFO L497 ElimStorePlain]: treesize reduction 44, result has 54.2 percent of original size 97.09/53.40 [2019-03-28 12:43:42,771 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:42,771 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:52 97.09/53.40 [2019-03-28 12:43:42,840 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 97.09/53.40 [2019-03-28 12:43:42,841 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 144 97.09/53.40 [2019-03-28 12:43:42,842 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:42,938 INFO L497 ElimStorePlain]: treesize reduction 76, result has 45.3 percent of original size 97.09/53.40 [2019-03-28 12:43:42,939 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:42,939 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:63 97.09/53.40 [2019-03-28 12:43:43,021 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 97.09/53.40 [2019-03-28 12:43:43,022 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 186 97.09/53.40 [2019-03-28 12:43:43,023 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:43,075 INFO L497 ElimStorePlain]: treesize reduction 116, result has 38.9 percent of original size 97.09/53.40 [2019-03-28 12:43:43,076 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:43,076 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:78, output treesize:74 97.09/53.40 [2019-03-28 12:43:43,232 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 97.09/53.40 [2019-03-28 12:43:43,233 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 102 97.09/53.40 [2019-03-28 12:43:43,234 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:43,252 INFO L497 ElimStorePlain]: treesize reduction 40, result has 32.2 percent of original size 97.09/53.40 [2019-03-28 12:43:43,252 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:43,253 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:81, output treesize:7 97.09/53.40 [2019-03-28 12:43:43,296 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. 97.09/53.40 [2019-03-28 12:43:43,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 97.09/53.40 [2019-03-28 12:43:43,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 97.09/53.40 [2019-03-28 12:43:43,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. 97.09/53.40 [2019-03-28 12:43:43,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 97.09/53.40 [2019-03-28 12:43:43,350 INFO L87 Difference]: Start difference. First operand 68 states and 92 transitions. cyclomatic complexity: 28 Second operand 19 states. 97.09/53.40 [2019-03-28 12:43:44,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 97.09/53.40 [2019-03-28 12:43:44,331 INFO L93 Difference]: Finished difference Result 123 states and 162 transitions. 97.09/53.40 [2019-03-28 12:43:44,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 97.09/53.40 [2019-03-28 12:43:44,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 162 transitions. 97.09/53.40 [2019-03-28 12:43:44,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 97.09/53.40 [2019-03-28 12:43:44,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 123 states and 162 transitions. 97.09/53.40 [2019-03-28 12:43:44,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 97.09/53.40 [2019-03-28 12:43:44,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 97.09/53.40 [2019-03-28 12:43:44,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 162 transitions. 97.09/53.40 [2019-03-28 12:43:44,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 97.09/53.40 [2019-03-28 12:43:44,338 INFO L706 BuchiCegarLoop]: Abstraction has 123 states and 162 transitions. 97.09/53.40 [2019-03-28 12:43:44,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 162 transitions. 97.09/53.40 [2019-03-28 12:43:44,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 71. 97.09/53.40 [2019-03-28 12:43:44,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. 97.09/53.40 [2019-03-28 12:43:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. 97.09/53.40 [2019-03-28 12:43:44,341 INFO L729 BuchiCegarLoop]: Abstraction has 71 states and 95 transitions. 97.09/53.40 [2019-03-28 12:43:44,341 INFO L609 BuchiCegarLoop]: Abstraction has 71 states and 95 transitions. 97.09/53.40 [2019-03-28 12:43:44,341 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ 97.09/53.40 [2019-03-28 12:43:44,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 95 transitions. 97.09/53.40 [2019-03-28 12:43:44,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 97.09/53.40 [2019-03-28 12:43:44,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 97.09/53.40 [2019-03-28 12:43:44,343 INFO L119 BuchiIsEmpty]: Starting construction of run 97.09/53.40 [2019-03-28 12:43:44,344 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 97.09/53.40 [2019-03-28 12:43:44,344 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 97.09/53.40 [2019-03-28 12:43:44,345 INFO L794 eck$LassoCheckResult]: Stem: 4684#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 4683#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 4661#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 4662#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 4672#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 4697#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 4673#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 4674#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 4677#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 4691#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 4694#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 4696#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 4693#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 4689#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 4653#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 4654#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 4714#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 4711#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 4707#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 4704#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 4702#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 4699#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 4690#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 4655#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 4656#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 4682#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 4679#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 4681#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 4715#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 4657#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 4658#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 4701#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 4723#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 4722#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 4721#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 4688#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 4660#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 4700#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 4698#L17-3 [282] L17-3-->L22-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_10 v_ULTIMATE.start_lis_~i~0_41) (= 0 v_ULTIMATE.start_lis_~i~0_40)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_41, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_40, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 4665#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 4666#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 4670#L23-1 [175] L23-1-->L24: Formula: (< v_ULTIMATE.start_lis_~max~0_3 |v_ULTIMATE.start_lis_#t~mem12_4|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_4|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_3} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_3|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_3} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 4671#L24 97.09/53.40 [2019-03-28 12:43:44,346 INFO L796 eck$LassoCheckResult]: Loop: 4671#L24 [287] L24-->L22-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_47))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_18))) (and (= (select (select |v_#memory_int_18| v_ULTIMATE.start_lis_~best~0.base_25) .cse0) v_ULTIMATE.start_lis_~max~0_10) (= 1 (select |v_#valid_44| v_ULTIMATE.start_lis_~best~0.base_25)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_18 4) (select |v_#length_28| v_ULTIMATE.start_lis_~best~0.base_25)) (<= 0 .cse0)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_25, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_47, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_18, #length=|v_#length_28|} OutVars{ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_5|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_25, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_47, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_10, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_18, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~max~0] 4668#L22-2 [130] L22-2-->L22-3: Formula: (= (+ v_ULTIMATE.start_lis_~i~0_35 1) v_ULTIMATE.start_lis_~i~0_34) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_35} OutVars{ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_2|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_34} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post11] 4669#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 4695#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 4692#L23-1 [175] L23-1-->L24: Formula: (< v_ULTIMATE.start_lis_~max~0_3 |v_ULTIMATE.start_lis_#t~mem12_4|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_4|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_3} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_3|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_3} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 4671#L24 97.09/53.40 [2019-03-28 12:43:44,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.40 [2019-03-28 12:43:44,346 INFO L82 PathProgramCache]: Analyzing trace with hash -466534763, now seen corresponding path program 1 times 97.09/53.40 [2019-03-28 12:43:44,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.40 [2019-03-28 12:43:44,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.40 [2019-03-28 12:43:44,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:44,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:44,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:44,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.40 [2019-03-28 12:43:44,372 INFO L82 PathProgramCache]: Analyzing trace with hash 297682139, now seen corresponding path program 1 times 97.09/53.40 [2019-03-28 12:43:44,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.40 [2019-03-28 12:43:44,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.40 [2019-03-28 12:43:44,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:44,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:44,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:44,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.40 [2019-03-28 12:43:44,377 INFO L82 PathProgramCache]: Analyzing trace with hash -315555129, now seen corresponding path program 1 times 97.09/53.40 [2019-03-28 12:43:44,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.40 [2019-03-28 12:43:44,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.40 [2019-03-28 12:43:44,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:44,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:44,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:43:44,758 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. 97.09/53.40 [2019-03-28 12:43:44,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 97.09/53.40 [2019-03-28 12:43:44,759 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 97.09/53.40 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 97.09/53.40 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 97.09/53.40 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 97.09/53.40 [2019-03-28 12:43:44,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:43:44,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 25 conjunts are in the unsatisfiable core 97.09/53.40 [2019-03-28 12:43:44,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... 97.09/53.40 [2019-03-28 12:43:44,807 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 97.09/53.40 [2019-03-28 12:43:44,807 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:44,813 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 97.09/53.40 [2019-03-28 12:43:44,814 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:44,814 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:11 97.09/53.40 [2019-03-28 12:43:44,855 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 15 treesize of output 11 97.09/53.40 [2019-03-28 12:43:44,855 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:44,862 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 97.09/53.40 [2019-03-28 12:43:44,863 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:44,863 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 97.09/53.40 [2019-03-28 12:43:44,892 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 97.09/53.40 [2019-03-28 12:43:44,892 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:44,901 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 97.09/53.40 [2019-03-28 12:43:44,902 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:44,902 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 97.09/53.40 [2019-03-28 12:43:44,943 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 97.09/53.40 [2019-03-28 12:43:44,944 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 66 97.09/53.40 [2019-03-28 12:43:44,944 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:44,971 INFO L497 ElimStorePlain]: treesize reduction 30, result has 57.1 percent of original size 97.09/53.40 [2019-03-28 12:43:44,972 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:44,972 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 97.09/53.40 [2019-03-28 12:43:45,023 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 97.09/53.40 [2019-03-28 12:43:45,023 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 94 97.09/53.40 [2019-03-28 12:43:45,024 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:45,056 INFO L497 ElimStorePlain]: treesize reduction 50, result has 50.5 percent of original size 97.09/53.40 [2019-03-28 12:43:45,057 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:45,057 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:51 97.09/53.40 [2019-03-28 12:43:45,400 INFO L340 Elim1Store]: treesize reduction 10, result has 80.4 percent of original size 97.09/53.40 [2019-03-28 12:43:45,400 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 62 97.09/53.40 [2019-03-28 12:43:45,404 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:45,419 INFO L497 ElimStorePlain]: treesize reduction 27, result has 34.1 percent of original size 97.09/53.40 [2019-03-28 12:43:45,420 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 97.09/53.40 [2019-03-28 12:43:45,420 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:71, output treesize:7 97.09/53.40 [2019-03-28 12:43:45,468 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. 97.09/53.40 [2019-03-28 12:43:45,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 97.09/53.40 [2019-03-28 12:43:45,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 97.09/53.40 [2019-03-28 12:43:45,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. 97.09/53.40 [2019-03-28 12:43:45,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 97.09/53.40 [2019-03-28 12:43:45,542 INFO L87 Difference]: Start difference. First operand 71 states and 95 transitions. cyclomatic complexity: 28 Second operand 26 states. 97.09/53.40 [2019-03-28 12:43:47,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 97.09/53.40 [2019-03-28 12:43:47,793 INFO L93 Difference]: Finished difference Result 150 states and 195 transitions. 97.09/53.40 [2019-03-28 12:43:47,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 97.09/53.40 [2019-03-28 12:43:47,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 195 transitions. 97.09/53.40 [2019-03-28 12:43:47,799 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 97.09/53.40 [2019-03-28 12:43:47,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 195 transitions. 97.09/53.40 [2019-03-28 12:43:47,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 97.09/53.40 [2019-03-28 12:43:47,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 97.09/53.40 [2019-03-28 12:43:47,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 195 transitions. 97.09/53.40 [2019-03-28 12:43:47,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 97.09/53.40 [2019-03-28 12:43:47,801 INFO L706 BuchiCegarLoop]: Abstraction has 150 states and 195 transitions. 97.09/53.40 [2019-03-28 12:43:47,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 195 transitions. 97.09/53.40 [2019-03-28 12:43:47,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 115. 97.09/53.40 [2019-03-28 12:43:47,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. 97.09/53.40 [2019-03-28 12:43:47,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. 97.09/53.40 [2019-03-28 12:43:47,804 INFO L729 BuchiCegarLoop]: Abstraction has 115 states and 154 transitions. 97.09/53.40 [2019-03-28 12:43:47,804 INFO L609 BuchiCegarLoop]: Abstraction has 115 states and 154 transitions. 97.09/53.40 [2019-03-28 12:43:47,804 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ 97.09/53.40 [2019-03-28 12:43:47,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 154 transitions. 97.09/53.40 [2019-03-28 12:43:47,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 97.09/53.40 [2019-03-28 12:43:47,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 97.09/53.40 [2019-03-28 12:43:47,805 INFO L119 BuchiIsEmpty]: Starting construction of run 97.09/53.40 [2019-03-28 12:43:47,806 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 97.09/53.40 [2019-03-28 12:43:47,806 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 97.09/53.40 [2019-03-28 12:43:47,807 INFO L794 eck$LassoCheckResult]: Stem: 5096#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 5095#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 5073#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 5074#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 5082#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 5086#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 5083#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 5084#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 5102#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 5103#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 5109#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 5110#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 5108#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 5104#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 5067#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 5068#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 5172#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 5166#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 5158#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 5154#L19-8 [154] L19-8-->L20: Formula: |v_ULTIMATE.start_lis_#t~short9_7| InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_7|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_4|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_4|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_4|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_4|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_6|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 5155#L20 [172] L20-->L20-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_10))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~best~0.offset_10 .cse1))) (and (= (select |v_#valid_19| v_ULTIMATE.start_lis_~best~0.base_13) 1) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_lis_~best~0.base_13) .cse0) |v_ULTIMATE.start_lis_#t~mem10_2|) (<= (+ v_ULTIMATE.start_lis_~best~0.offset_10 .cse1 4) (select |v_#length_17| v_ULTIMATE.start_lis_~best~0.base_13)) (<= 0 .cse0)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_13, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_10, #length=|v_#length_17|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_13, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_10, #length=|v_#length_17|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem10] 5162#L20-1 [289] L20-1-->L20-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_49))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~best~0.offset_19 .cse1))) (and (= (store |v_#memory_int_20| v_ULTIMATE.start_lis_~best~0.base_26 (store (select |v_#memory_int_20| v_ULTIMATE.start_lis_~best~0.base_26) .cse0 (+ |v_ULTIMATE.start_lis_#t~mem10_6| 1))) |v_#memory_int_19|) (<= 0 .cse0) (= 1 (select |v_#valid_47| v_ULTIMATE.start_lis_~best~0.base_26)) (<= (+ v_ULTIMATE.start_lis_~best~0.offset_19 .cse1 4) (select |v_#length_29| v_ULTIMATE.start_lis_~best~0.base_26))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_26, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_49, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_19, #length=|v_#length_29|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_6|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_26, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_49, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_19, #length=|v_#length_29|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_lis_#t~mem10] 5156#L20-3 [164] L20-3-->L18-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_23))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_6 .cse1))) (and (= (store |v_#memory_int_13| v_ULTIMATE.start_lis_~prev~0.base_7 (store (select |v_#memory_int_13| v_ULTIMATE.start_lis_~prev~0.base_7) .cse0 v_ULTIMATE.start_lis_~j~0_12)) |v_#memory_int_12|) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_6 .cse1 4) (select |v_#length_21| v_ULTIMATE.start_lis_~prev~0.base_7)) (= (select |v_#valid_23| v_ULTIMATE.start_lis_~prev~0.base_7) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_12, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_23, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_7, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_6} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_12, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_23, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_7, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_12|, #length=|v_#length_21|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_6} AuxVars[] AssignedVars[#memory_int] 5153#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 5113#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 5105#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 5106#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 5181#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 5093#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 5090#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 5092#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 5099#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 5071#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 5069#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 5070#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 5094#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 5180#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 5177#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 5176#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 5174#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 5128#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 5125#L17-3 [282] L17-3-->L22-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_10 v_ULTIMATE.start_lis_~i~0_41) (= 0 v_ULTIMATE.start_lis_~i~0_40)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_41, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_40, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 5117#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 5118#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 5111#L23-1 [175] L23-1-->L24: Formula: (< v_ULTIMATE.start_lis_~max~0_3 |v_ULTIMATE.start_lis_#t~mem12_4|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_4|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_3} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_3|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_3} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 5101#L24 97.09/53.40 [2019-03-28 12:43:47,808 INFO L796 eck$LassoCheckResult]: Loop: 5101#L24 [287] L24-->L22-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_47))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_18))) (and (= (select (select |v_#memory_int_18| v_ULTIMATE.start_lis_~best~0.base_25) .cse0) v_ULTIMATE.start_lis_~max~0_10) (= 1 (select |v_#valid_44| v_ULTIMATE.start_lis_~best~0.base_25)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_18 4) (select |v_#length_28| v_ULTIMATE.start_lis_~best~0.base_25)) (<= 0 .cse0)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_25, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_47, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_18, #length=|v_#length_28|} OutVars{ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_5|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_25, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_47, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_10, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_18, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~max~0] 5080#L22-2 [130] L22-2-->L22-3: Formula: (= (+ v_ULTIMATE.start_lis_~i~0_35 1) v_ULTIMATE.start_lis_~i~0_34) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_35} OutVars{ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_2|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_34} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post11] 5076#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 5077#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 5112#L23-1 [175] L23-1-->L24: Formula: (< v_ULTIMATE.start_lis_~max~0_3 |v_ULTIMATE.start_lis_#t~mem12_4|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_4|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_3} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_3|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_3} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 5101#L24 97.09/53.40 [2019-03-28 12:43:47,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.40 [2019-03-28 12:43:47,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1577887719, now seen corresponding path program 1 times 97.09/53.40 [2019-03-28 12:43:47,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.40 [2019-03-28 12:43:47,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.40 [2019-03-28 12:43:47,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:47,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:47,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:43:47,825 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. 97.09/53.40 [2019-03-28 12:43:47,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 97.09/53.40 [2019-03-28 12:43:47,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 97.09/53.40 [2019-03-28 12:43:47,826 INFO L799 eck$LassoCheckResult]: stem already infeasible 97.09/53.40 [2019-03-28 12:43:47,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.40 [2019-03-28 12:43:47,827 INFO L82 PathProgramCache]: Analyzing trace with hash 297682139, now seen corresponding path program 2 times 97.09/53.40 [2019-03-28 12:43:47,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.40 [2019-03-28 12:43:47,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.40 [2019-03-28 12:43:47,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:47,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:47,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:47,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 97.09/53.40 [2019-03-28 12:43:47,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 97.09/53.40 [2019-03-28 12:43:47,886 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. cyclomatic complexity: 45 Second operand 3 states. 97.09/53.40 [2019-03-28 12:43:47,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 97.09/53.40 [2019-03-28 12:43:47,923 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. 97.09/53.40 [2019-03-28 12:43:47,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 97.09/53.40 [2019-03-28 12:43:47,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 142 transitions. 97.09/53.40 [2019-03-28 12:43:47,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 97.09/53.40 [2019-03-28 12:43:47,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 115 states and 142 transitions. 97.09/53.40 [2019-03-28 12:43:47,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 97.09/53.40 [2019-03-28 12:43:47,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 97.09/53.40 [2019-03-28 12:43:47,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 142 transitions. 97.09/53.40 [2019-03-28 12:43:47,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 97.09/53.40 [2019-03-28 12:43:47,930 INFO L706 BuchiCegarLoop]: Abstraction has 115 states and 142 transitions. 97.09/53.40 [2019-03-28 12:43:47,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 142 transitions. 97.09/53.40 [2019-03-28 12:43:47,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. 97.09/53.40 [2019-03-28 12:43:47,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. 97.09/53.40 [2019-03-28 12:43:47,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 142 transitions. 97.09/53.40 [2019-03-28 12:43:47,933 INFO L729 BuchiCegarLoop]: Abstraction has 115 states and 142 transitions. 97.09/53.40 [2019-03-28 12:43:47,933 INFO L609 BuchiCegarLoop]: Abstraction has 115 states and 142 transitions. 97.09/53.40 [2019-03-28 12:43:47,933 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ 97.09/53.40 [2019-03-28 12:43:47,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 142 transitions. 97.09/53.40 [2019-03-28 12:43:47,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 97.09/53.40 [2019-03-28 12:43:47,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 97.09/53.40 [2019-03-28 12:43:47,934 INFO L119 BuchiIsEmpty]: Starting construction of run 97.09/53.40 [2019-03-28 12:43:47,935 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 97.09/53.40 [2019-03-28 12:43:47,935 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 97.09/53.40 [2019-03-28 12:43:47,936 INFO L794 eck$LassoCheckResult]: Stem: 5337#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 5336#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 5310#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 5311#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 5321#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 5343#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 5322#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 5323#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 5326#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 5350#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 5348#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 5349#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 5347#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 5344#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 5303#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 5304#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 5391#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 5388#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 5386#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 5385#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 5384#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 5383#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 5382#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 5358#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 5381#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 5379#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 5376#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 5374#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 5373#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 5372#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 5371#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 5360#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 5369#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 5366#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 5363#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 5362#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 5361#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 5359#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 5357#L17-3 [282] L17-3-->L22-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_10 v_ULTIMATE.start_lis_~i~0_41) (= 0 v_ULTIMATE.start_lis_~i~0_40)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_41, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_40, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 5356#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 5324#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 5325#L23-1 [175] L23-1-->L24: Formula: (< v_ULTIMATE.start_lis_~max~0_3 |v_ULTIMATE.start_lis_#t~mem12_4|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_4|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_3} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_3|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_3} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 5341#L24 [287] L24-->L22-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_47))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_18))) (and (= (select (select |v_#memory_int_18| v_ULTIMATE.start_lis_~best~0.base_25) .cse0) v_ULTIMATE.start_lis_~max~0_10) (= 1 (select |v_#valid_44| v_ULTIMATE.start_lis_~best~0.base_25)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_18 4) (select |v_#length_28| v_ULTIMATE.start_lis_~best~0.base_25)) (<= 0 .cse0)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_25, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_47, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_18, #length=|v_#length_28|} OutVars{ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_5|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_25, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_47, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_10, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_18, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~max~0] 5342#L22-2 [130] L22-2-->L22-3: Formula: (= (+ v_ULTIMATE.start_lis_~i~0_35 1) v_ULTIMATE.start_lis_~i~0_34) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_35} OutVars{ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_2|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_34} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post11] 5355#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 5353#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 5351#L23-1 [208] L23-1-->L22-2: Formula: (>= v_ULTIMATE.start_lis_~max~0_5 |v_ULTIMATE.start_lis_#t~mem12_6|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_6|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_5|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 5317#L22-2 97.09/53.40 [2019-03-28 12:43:47,937 INFO L796 eck$LassoCheckResult]: Loop: 5317#L22-2 [130] L22-2-->L22-3: Formula: (= (+ v_ULTIMATE.start_lis_~i~0_35 1) v_ULTIMATE.start_lis_~i~0_34) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_35} OutVars{ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_2|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_34} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post11] 5318#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 5354#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 5352#L23-1 [208] L23-1-->L22-2: Formula: (>= v_ULTIMATE.start_lis_~max~0_5 |v_ULTIMATE.start_lis_#t~mem12_6|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_6|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_5|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 5317#L22-2 97.09/53.40 [2019-03-28 12:43:47,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.40 [2019-03-28 12:43:47,937 INFO L82 PathProgramCache]: Analyzing trace with hash -315555096, now seen corresponding path program 1 times 97.09/53.40 [2019-03-28 12:43:47,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.40 [2019-03-28 12:43:47,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.40 [2019-03-28 12:43:47,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:47,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:47,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:47,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.40 [2019-03-28 12:43:47,973 INFO L82 PathProgramCache]: Analyzing trace with hash 4926015, now seen corresponding path program 6 times 97.09/53.40 [2019-03-28 12:43:47,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.40 [2019-03-28 12:43:47,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.40 [2019-03-28 12:43:47,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:47,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:47,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:47,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.40 [2019-03-28 12:43:47,977 INFO L82 PathProgramCache]: Analyzing trace with hash 367157670, now seen corresponding path program 2 times 97.09/53.40 [2019-03-28 12:43:47,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.40 [2019-03-28 12:43:47,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.40 [2019-03-28 12:43:47,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:47,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:47,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:51,929 WARN L188 SmtUtils]: Spent 3.88 s on a formula simplification. DAG size of input: 266 DAG size of output: 209 97.09/53.40 [2019-03-28 12:43:52,841 WARN L188 SmtUtils]: Spent 903.00 ms on a formula simplification that was a NOOP. DAG size: 138 97.09/53.40 [2019-03-28 12:43:52,844 INFO L216 LassoAnalysis]: Preferences: 97.09/53.40 [2019-03-28 12:43:52,845 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 97.09/53.40 [2019-03-28 12:43:52,845 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 97.09/53.40 [2019-03-28 12:43:52,845 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 97.09/53.40 [2019-03-28 12:43:52,845 INFO L127 ssoRankerPreferences]: Use exernal solver: false 97.09/53.40 [2019-03-28 12:43:52,845 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 97.09/53.40 [2019-03-28 12:43:52,845 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 97.09/53.40 [2019-03-28 12:43:52,845 INFO L130 ssoRankerPreferences]: Path of dumped script: 97.09/53.40 [2019-03-28 12:43:52,845 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration23_Lasso 97.09/53.40 [2019-03-28 12:43:52,845 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 97.09/53.40 [2019-03-28 12:43:52,846 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 97.09/53.40 [2019-03-28 12:43:52,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:52,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:52,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:52,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:52,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:52,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:52,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:52,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:52,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:52,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:52,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:52,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:52,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:52,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:52,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:53,612 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 93 97.09/53.40 [2019-03-28 12:43:53,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:53,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:53,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:53,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:53,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:53,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:43:53,852 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 97.09/53.40 [2019-03-28 12:43:54,090 INFO L300 LassoAnalysis]: Preprocessing complete. 97.09/53.40 [2019-03-28 12:43:54,090 INFO L497 LassoAnalysis]: Using template 'affine'. 97.09/53.40 [2019-03-28 12:43:54,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:54,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:54,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.40 [2019-03-28 12:43:54,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:54,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:54,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:54,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:54,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:54,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:54,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:54,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:54,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.40 [2019-03-28 12:43:54,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:54,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:54,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:54,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:54,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:54,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:54,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:54,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:54,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.40 [2019-03-28 12:43:54,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:54,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:54,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:54,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:54,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:54,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:54,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:54,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:54,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.40 [2019-03-28 12:43:54,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:54,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:54,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:54,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:54,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:54,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:54,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:54,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:54,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.40 [2019-03-28 12:43:54,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:54,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:54,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:54,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:54,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:54,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:54,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:54,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:54,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.40 [2019-03-28 12:43:54,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:54,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:54,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:54,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:54,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:54,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:54,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:54,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:54,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:54,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:54,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:54,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:54,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:54,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:54,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:54,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:54,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.40 [2019-03-28 12:43:54,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:54,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:54,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:54,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:54,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:54,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:54,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:54,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:54,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.40 [2019-03-28 12:43:54,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:54,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:54,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:54,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:54,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:54,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:54,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:54,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:54,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.40 [2019-03-28 12:43:54,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:54,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:54,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:54,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:54,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:54,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:54,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:54,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:54,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.40 [2019-03-28 12:43:54,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:54,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:54,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:54,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:54,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:54,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:54,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:54,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:54,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:54,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:54,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:54,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:54,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:54,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:54,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:54,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:54,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:54,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:54,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:54,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:54,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:54,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:54,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:54,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:54,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.40 [2019-03-28 12:43:54,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:54,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:54,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:54,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:54,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:54,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:54,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:54,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:54,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:54,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:54,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:54,117 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:54,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:54,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:54,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:54,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:54,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:54,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:54,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:54,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:54,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:54,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:54,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:54,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:54,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:54,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:54,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:54,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:54,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:54,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:43:54,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:43:54,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:43:54,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:43:54,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:43:54,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:43:54,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:43:54,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:43:54,142 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 97.09/53.40 [2019-03-28 12:43:54,154 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 97.09/53.40 [2019-03-28 12:43:54,154 INFO L444 ModelExtractionUtils]: 39 out of 46 variables were initially zero. Simplification set additionally 4 variables to zero. 97.09/53.40 [2019-03-28 12:43:54,155 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 97.09/53.40 [2019-03-28 12:43:54,155 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 97.09/53.40 [2019-03-28 12:43:54,155 INFO L518 LassoAnalysis]: Proved termination. 97.09/53.40 [2019-03-28 12:43:54,155 INFO L520 LassoAnalysis]: Termination argument consisting of: 97.09/53.40 Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N 97.09/53.40 Supporting invariants [] 97.09/53.40 [2019-03-28 12:43:54,232 INFO L297 tatePredicateManager]: 22 out of 22 supporting invariants were superfluous and have been removed 97.09/53.40 [2019-03-28 12:43:54,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.40 [2019-03-28 12:43:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:43:54,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core 97.09/53.40 [2019-03-28 12:43:54,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... 97.09/53.40 [2019-03-28 12:43:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:43:54,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core 97.09/53.40 [2019-03-28 12:43:54,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... 97.09/53.40 [2019-03-28 12:43:54,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 97.09/53.40 [2019-03-28 12:43:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:43:54,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core 97.09/53.40 [2019-03-28 12:43:54,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... 97.09/53.40 [2019-03-28 12:43:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:43:54,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core 97.09/53.40 [2019-03-28 12:43:54,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... 97.09/53.40 [2019-03-28 12:43:54,334 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 97.09/53.40 [2019-03-28 12:43:54,335 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 97.09/53.40 [2019-03-28 12:43:54,335 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 115 states and 142 transitions. cyclomatic complexity: 33 Second operand 4 states. 97.09/53.40 [2019-03-28 12:43:54,414 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 115 states and 142 transitions. cyclomatic complexity: 33. Second operand 4 states. Result 135 states and 166 transitions. Complement of second has 13 states. 97.09/53.40 [2019-03-28 12:43:54,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states 97.09/53.40 [2019-03-28 12:43:54,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 97.09/53.40 [2019-03-28 12:43:54,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. 97.09/53.40 [2019-03-28 12:43:54,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 47 letters. Loop has 4 letters. 97.09/53.40 [2019-03-28 12:43:54,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. 97.09/53.40 [2019-03-28 12:43:54,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 51 letters. Loop has 4 letters. 97.09/53.40 [2019-03-28 12:43:54,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. 97.09/53.40 [2019-03-28 12:43:54,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 47 letters. Loop has 8 letters. 97.09/53.40 [2019-03-28 12:43:54,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. 97.09/53.40 [2019-03-28 12:43:54,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 166 transitions. 97.09/53.40 [2019-03-28 12:43:54,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 97.09/53.40 [2019-03-28 12:43:54,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 107 states and 132 transitions. 97.09/53.40 [2019-03-28 12:43:54,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 97.09/53.40 [2019-03-28 12:43:54,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 97.09/53.40 [2019-03-28 12:43:54,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 132 transitions. 97.09/53.40 [2019-03-28 12:43:54,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 97.09/53.40 [2019-03-28 12:43:54,423 INFO L706 BuchiCegarLoop]: Abstraction has 107 states and 132 transitions. 97.09/53.40 [2019-03-28 12:43:54,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 132 transitions. 97.09/53.40 [2019-03-28 12:43:54,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. 97.09/53.40 [2019-03-28 12:43:54,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. 97.09/53.40 [2019-03-28 12:43:54,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 128 transitions. 97.09/53.40 [2019-03-28 12:43:54,426 INFO L729 BuchiCegarLoop]: Abstraction has 103 states and 128 transitions. 97.09/53.40 [2019-03-28 12:43:54,426 INFO L609 BuchiCegarLoop]: Abstraction has 103 states and 128 transitions. 97.09/53.40 [2019-03-28 12:43:54,426 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ 97.09/53.40 [2019-03-28 12:43:54,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 128 transitions. 97.09/53.40 [2019-03-28 12:43:54,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 97.09/53.40 [2019-03-28 12:43:54,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 97.09/53.40 [2019-03-28 12:43:54,427 INFO L119 BuchiIsEmpty]: Starting construction of run 97.09/53.40 [2019-03-28 12:43:54,427 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 97.09/53.40 [2019-03-28 12:43:54,427 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 97.09/53.40 [2019-03-28 12:43:54,429 INFO L794 eck$LassoCheckResult]: Stem: 5879#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 5878#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 5856#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 5857#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 5866#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 5869#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 5867#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 5868#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 5882#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 5883#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 5887#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 5888#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 5886#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 5884#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 5848#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 5849#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 5947#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 5945#L19-2 [251] L19-2-->L19-3: Formula: (and |v_ULTIMATE.start_lis_#t~short9_2| (< |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 5944#L19-3 [144] L19-3-->L19-4: Formula: |v_ULTIMATE.start_lis_#t~short9_3| InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_3|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_3|} AuxVars[] AssignedVars[] 5941#L19-4 [140] L19-4-->L19-5: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_19))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_6))) (and (<= 0 .cse0) (= 1 (select |v_#valid_15| v_ULTIMATE.start_lis_~best~0.base_7)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_lis_~best~0.base_7)) (= |v_ULTIMATE.start_lis_#t~mem8_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_lis_~best~0.base_7) .cse0))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_7, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_19, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_6, #length=|v_#length_13|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_7, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_2|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_19, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_6, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem8] 5937#L19-5 [161] L19-5-->L19-6: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~j~0_8))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_8))) (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_lis_~best~0.base_10)) (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_8 4) (select |v_#length_15| v_ULTIMATE.start_lis_~best~0.base_10)) (<= 0 .cse1) (= |v_ULTIMATE.start_lis_#t~mem7_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_lis_~best~0.base_10) .cse1))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_10, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_8, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_8, #length=|v_#length_15|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_10, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_8, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_8, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7] 5926#L19-6 [270] L19-6-->L19-8: Formula: (and |v_ULTIMATE.start_lis_#t~short9_4| (< |v_ULTIMATE.start_lis_#t~mem8_3| (+ |v_ULTIMATE.start_lis_#t~mem7_3| 1))) InVars {ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_3|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_3|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_3|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 5924#L19-8 [154] L19-8-->L20: Formula: |v_ULTIMATE.start_lis_#t~short9_7| InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_7|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_4|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_4|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_4|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_4|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_6|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 5921#L20 [172] L20-->L20-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_10))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~best~0.offset_10 .cse1))) (and (= (select |v_#valid_19| v_ULTIMATE.start_lis_~best~0.base_13) 1) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_lis_~best~0.base_13) .cse0) |v_ULTIMATE.start_lis_#t~mem10_2|) (<= (+ v_ULTIMATE.start_lis_~best~0.offset_10 .cse1 4) (select |v_#length_17| v_ULTIMATE.start_lis_~best~0.base_13)) (<= 0 .cse0)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_13, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_10, #length=|v_#length_17|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_13, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_10, #length=|v_#length_17|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem10] 5917#L20-1 [289] L20-1-->L20-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_49))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~best~0.offset_19 .cse1))) (and (= (store |v_#memory_int_20| v_ULTIMATE.start_lis_~best~0.base_26 (store (select |v_#memory_int_20| v_ULTIMATE.start_lis_~best~0.base_26) .cse0 (+ |v_ULTIMATE.start_lis_#t~mem10_6| 1))) |v_#memory_int_19|) (<= 0 .cse0) (= 1 (select |v_#valid_47| v_ULTIMATE.start_lis_~best~0.base_26)) (<= (+ v_ULTIMATE.start_lis_~best~0.offset_19 .cse1 4) (select |v_#length_29| v_ULTIMATE.start_lis_~best~0.base_26))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_26, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_49, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_19, #length=|v_#length_29|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_6|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_26, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_49, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_19, #length=|v_#length_29|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_lis_#t~mem10] 5854#L20-3 [164] L20-3-->L18-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_23))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_6 .cse1))) (and (= (store |v_#memory_int_13| v_ULTIMATE.start_lis_~prev~0.base_7 (store (select |v_#memory_int_13| v_ULTIMATE.start_lis_~prev~0.base_7) .cse0 v_ULTIMATE.start_lis_~j~0_12)) |v_#memory_int_12|) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_6 .cse1 4) (select |v_#length_21| v_ULTIMATE.start_lis_~prev~0.base_7)) (= (select |v_#valid_23| v_ULTIMATE.start_lis_~prev~0.base_7) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_12, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_23, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_7, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_6} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_12, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_23, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_7, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_12|, #length=|v_#length_21|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_6} AuxVars[] AssignedVars[#memory_int] 5855#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 5932#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 5931#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 5890#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 5928#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 5925#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 5922#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 5918#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 5913#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 5911#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 5909#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 5892#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 5904#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 5901#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 5897#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 5895#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 5893#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 5891#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 5889#L17-3 [282] L17-3-->L22-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_10 v_ULTIMATE.start_lis_~i~0_41) (= 0 v_ULTIMATE.start_lis_~i~0_40)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_41, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_40, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 5860#L22-3 97.09/53.40 [2019-03-28 12:43:54,429 INFO L796 eck$LassoCheckResult]: Loop: 5860#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 5861#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 5864#L23-1 [175] L23-1-->L24: Formula: (< v_ULTIMATE.start_lis_~max~0_3 |v_ULTIMATE.start_lis_#t~mem12_4|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_4|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_3} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_3|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_3} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 5865#L24 [287] L24-->L22-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_47))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_18))) (and (= (select (select |v_#memory_int_18| v_ULTIMATE.start_lis_~best~0.base_25) .cse0) v_ULTIMATE.start_lis_~max~0_10) (= 1 (select |v_#valid_44| v_ULTIMATE.start_lis_~best~0.base_25)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_18 4) (select |v_#length_28| v_ULTIMATE.start_lis_~best~0.base_25)) (<= 0 .cse0)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_25, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_47, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_18, #length=|v_#length_28|} OutVars{ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_5|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_25, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_47, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_10, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_18, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~max~0] 5863#L22-2 [130] L22-2-->L22-3: Formula: (= (+ v_ULTIMATE.start_lis_~i~0_35 1) v_ULTIMATE.start_lis_~i~0_34) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_35} OutVars{ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_2|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_34} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post11] 5860#L22-3 97.09/53.40 [2019-03-28 12:43:54,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.40 [2019-03-28 12:43:54,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1200502103, now seen corresponding path program 1 times 97.09/53.40 [2019-03-28 12:43:54,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.40 [2019-03-28 12:43:54,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.40 [2019-03-28 12:43:54,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:54,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:54,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:54,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.40 [2019-03-28 12:43:54,473 INFO L82 PathProgramCache]: Analyzing trace with hash 153213569, now seen corresponding path program 3 times 97.09/53.40 [2019-03-28 12:43:54,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.40 [2019-03-28 12:43:54,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.40 [2019-03-28 12:43:54,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:54,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:54,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:54,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.40 [2019-03-28 12:43:54,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1307413227, now seen corresponding path program 1 times 97.09/53.40 [2019-03-28 12:43:54,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 97.09/53.40 [2019-03-28 12:43:54,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 97.09/53.40 [2019-03-28 12:43:54,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:54,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:54,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 97.09/53.40 [2019-03-28 12:43:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:43:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 97.09/53.40 [2019-03-28 12:44:01,246 WARN L188 SmtUtils]: Spent 6.68 s on a formula simplification. DAG size of input: 274 DAG size of output: 213 97.09/53.40 [2019-03-28 12:44:03,150 WARN L188 SmtUtils]: Spent 1.89 s on a formula simplification that was a NOOP. DAG size: 146 97.09/53.40 [2019-03-28 12:44:03,154 INFO L216 LassoAnalysis]: Preferences: 97.09/53.40 [2019-03-28 12:44:03,154 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 97.09/53.40 [2019-03-28 12:44:03,154 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 97.09/53.40 [2019-03-28 12:44:03,154 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 97.09/53.40 [2019-03-28 12:44:03,154 INFO L127 ssoRankerPreferences]: Use exernal solver: false 97.09/53.40 [2019-03-28 12:44:03,155 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 97.09/53.40 [2019-03-28 12:44:03,155 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 97.09/53.40 [2019-03-28 12:44:03,155 INFO L130 ssoRankerPreferences]: Path of dumped script: 97.09/53.40 [2019-03-28 12:44:03,155 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration24_Lasso 97.09/53.40 [2019-03-28 12:44:03,155 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 97.09/53.40 [2019-03-28 12:44:03,155 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 97.09/53.40 [2019-03-28 12:44:03,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:44:03,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:44:03,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:44:03,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:44:04,132 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 97 97.09/53.40 [2019-03-28 12:44:04,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:44:04,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:44:04,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:44:04,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:44:04,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:44:04,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:44:04,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:44:04,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:44:04,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:44:04,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:44:04,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:44:04,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:44:04,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:44:04,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:44:04,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 97.09/53.40 [2019-03-28 12:44:04,399 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 97.09/53.40 [2019-03-28 12:44:04,631 INFO L300 LassoAnalysis]: Preprocessing complete. 97.09/53.40 [2019-03-28 12:44:04,631 INFO L497 LassoAnalysis]: Using template 'affine'. 97.09/53.40 [2019-03-28 12:44:04,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:44:04,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:44:04,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.40 [2019-03-28 12:44:04,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:44:04,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:44:04,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:44:04,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:44:04,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.40 [2019-03-28 12:44:04,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:44:04,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:44:04,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:44:04,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.40 [2019-03-28 12:44:04,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:44:04,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:44:04,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:44:04,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:44:04,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.40 [2019-03-28 12:44:04,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:44:04,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:44:04,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:44:04,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.40 [2019-03-28 12:44:04,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:44:04,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:44:04,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:44:04,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:44:04,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.40 [2019-03-28 12:44:04,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:44:04,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:44:04,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:44:04,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:44:04,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:44:04,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:44:04,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:44:04,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:44:04,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:44:04,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:44:04,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:44:04,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:44:04,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:44:04,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:44:04,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:44:04,642 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:44:04,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:44:04,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:44:04,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:44:04,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:44:04,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:44:04,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:44:04,647 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:44:04,647 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:44:04,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:44:04,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:44:04,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:44:04,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 97.09/53.40 [2019-03-28 12:44:04,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:44:04,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:44:04,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:44:04,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:44:04,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 97.09/53.40 [2019-03-28 12:44:04,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:44:04,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:44:04,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:44:04,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:44:04,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:44:04,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:44:04,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:44:04,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:44:04,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:44:04,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:44:04,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:44:04,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:44:04,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:44:04,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:44:04,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:44:04,654 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:44:04,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:44:04,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:44:04,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:44:04,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:44:04,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:44:04,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:44:04,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:44:04,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:44:04,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 97.09/53.40 [2019-03-28 12:44:04,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 97.09/53.40 Termination analysis: LINEAR_WITH_GUESSES 97.09/53.40 Number of strict supporting invariants: 0 97.09/53.40 Number of non-strict supporting invariants: 1 97.09/53.40 Consider only non-deceasing supporting invariants: true 97.09/53.40 Simplify termination arguments: true 97.09/53.40 Simplify supporting invariants: trueOverapproximate stem: false 97.09/53.40 [2019-03-28 12:44:04,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. 97.09/53.40 [2019-03-28 12:44:04,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 97.09/53.40 [2019-03-28 12:44:04,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 97.09/53.40 [2019-03-28 12:44:04,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 97.09/53.40 [2019-03-28 12:44:04,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 97.09/53.40 [2019-03-28 12:44:04,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 97.09/53.40 [2019-03-28 12:44:04,671 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 97.09/53.40 [2019-03-28 12:44:04,681 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 97.09/53.40 [2019-03-28 12:44:04,682 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. 97.09/53.40 [2019-03-28 12:44:04,682 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 97.09/53.40 [2019-03-28 12:44:04,683 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 97.09/53.40 [2019-03-28 12:44:04,683 INFO L518 LassoAnalysis]: Proved termination. 97.09/53.40 [2019-03-28 12:44:04,683 INFO L520 LassoAnalysis]: Termination argument consisting of: 97.09/53.40 Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N 97.09/53.40 Supporting invariants [] 97.09/53.40 [2019-03-28 12:44:04,735 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed 97.09/53.40 [2019-03-28 12:44:04,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 97.09/53.40 [2019-03-28 12:44:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:44:04,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 2 conjunts are in the unsatisfiable core 97.09/53.40 [2019-03-28 12:44:04,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... 97.09/53.40 [2019-03-28 12:44:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:44:04,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core 97.09/53.40 [2019-03-28 12:44:04,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... 97.09/53.40 [2019-03-28 12:44:04,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 97.09/53.40 [2019-03-28 12:44:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:44:04,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core 97.09/53.40 [2019-03-28 12:44:04,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... 97.09/53.40 [2019-03-28 12:44:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 97.09/53.40 [2019-03-28 12:44:04,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core 97.09/53.40 [2019-03-28 12:44:04,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... 97.09/53.40 [2019-03-28 12:44:04,839 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 97.09/53.40 [2019-03-28 12:44:04,840 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 97.09/53.40 [2019-03-28 12:44:04,840 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 103 states and 128 transitions. cyclomatic complexity: 31 Second operand 3 states. 97.09/53.40 [2019-03-28 12:44:04,874 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 103 states and 128 transitions. cyclomatic complexity: 31. Second operand 3 states. Result 108 states and 134 transitions. Complement of second has 4 states. 97.09/53.40 [2019-03-28 12:44:04,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 97.09/53.40 [2019-03-28 12:44:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 97.09/53.40 [2019-03-28 12:44:04,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. 97.09/53.40 [2019-03-28 12:44:04,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 45 letters. Loop has 5 letters. 97.09/53.40 [2019-03-28 12:44:04,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. 97.09/53.40 [2019-03-28 12:44:04,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 50 letters. Loop has 5 letters. 97.09/53.40 [2019-03-28 12:44:04,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. 97.09/53.40 [2019-03-28 12:44:04,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 45 letters. Loop has 10 letters. 97.09/53.40 [2019-03-28 12:44:04,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. 97.09/53.40 [2019-03-28 12:44:04,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 134 transitions. 97.09/53.40 [2019-03-28 12:44:04,881 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 97.09/53.40 [2019-03-28 12:44:04,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 0 states and 0 transitions. 97.09/53.40 [2019-03-28 12:44:04,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 97.09/53.40 [2019-03-28 12:44:04,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 97.09/53.40 [2019-03-28 12:44:04,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 97.09/53.40 [2019-03-28 12:44:04,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 97.09/53.40 [2019-03-28 12:44:04,882 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 97.09/53.40 [2019-03-28 12:44:04,882 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 97.09/53.40 [2019-03-28 12:44:04,882 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 97.09/53.40 [2019-03-28 12:44:04,883 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ 97.09/53.40 [2019-03-28 12:44:04,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 97.09/53.40 [2019-03-28 12:44:04,883 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 97.09/53.40 [2019-03-28 12:44:04,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 97.09/53.40 [2019-03-28 12:44:04,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:04 BasicIcfg 97.09/53.40 [2019-03-28 12:44:04,890 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 97.09/53.40 [2019-03-28 12:44:04,890 INFO L168 Benchmark]: Toolchain (without parser) took 49046.96 ms. Allocated memory was 649.6 MB in the beginning and 1.3 GB in the end (delta: 659.0 MB). Free memory was 565.0 MB in the beginning and 595.0 MB in the end (delta: -30.0 MB). Peak memory consumption was 629.0 MB. Max. memory is 50.3 GB. 97.09/53.40 [2019-03-28 12:44:04,891 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 97.09/53.40 [2019-03-28 12:44:04,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.66 ms. Allocated memory was 649.6 MB in the beginning and 673.7 MB in the end (delta: 24.1 MB). Free memory was 565.0 MB in the beginning and 640.9 MB in the end (delta: -75.9 MB). Peak memory consumption was 33.1 MB. Max. memory is 50.3 GB. 97.09/53.40 [2019-03-28 12:44:04,892 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.26 ms. Allocated memory is still 673.7 MB. Free memory was 640.9 MB in the beginning and 636.5 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 50.3 GB. 97.09/53.40 [2019-03-28 12:44:04,892 INFO L168 Benchmark]: Boogie Preprocessor took 30.13 ms. Allocated memory is still 673.7 MB. Free memory was 636.5 MB in the beginning and 635.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 97.09/53.40 [2019-03-28 12:44:04,893 INFO L168 Benchmark]: RCFGBuilder took 402.62 ms. Allocated memory is still 673.7 MB. Free memory was 635.1 MB in the beginning and 604.8 MB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 50.3 GB. 97.09/53.40 [2019-03-28 12:44:04,893 INFO L168 Benchmark]: BlockEncodingV2 took 168.09 ms. Allocated memory is still 673.7 MB. Free memory was 604.8 MB in the beginning and 592.7 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. 97.09/53.40 [2019-03-28 12:44:04,893 INFO L168 Benchmark]: TraceAbstraction took 4148.55 ms. Allocated memory was 673.7 MB in the beginning and 763.4 MB in the end (delta: 89.7 MB). Free memory was 591.4 MB in the beginning and 722.2 MB in the end (delta: -130.9 MB). Peak memory consumption was 307.6 MB. Max. memory is 50.3 GB. 97.09/53.40 [2019-03-28 12:44:04,894 INFO L168 Benchmark]: BuchiAutomizer took 43922.09 ms. Allocated memory was 763.4 MB in the beginning and 1.3 GB in the end (delta: 545.3 MB). Free memory was 722.2 MB in the beginning and 595.0 MB in the end (delta: 127.3 MB). Peak memory consumption was 672.5 MB. Max. memory is 50.3 GB. 97.09/53.40 [2019-03-28 12:44:04,897 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 97.09/53.40 --- Results --- 97.09/53.40 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 97.09/53.40 - StatisticsResult: Initial Icfg 97.09/53.40 59 locations, 70 edges 97.09/53.40 - StatisticsResult: Encoded RCFG 97.09/53.40 47 locations, 85 edges 97.09/53.40 * Results from de.uni_freiburg.informatik.ultimate.core: 97.09/53.40 - StatisticsResult: Toolchain Benchmarks 97.09/53.40 Benchmark results are: 97.09/53.40 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 97.09/53.40 * CACSL2BoogieTranslator took 323.66 ms. Allocated memory was 649.6 MB in the beginning and 673.7 MB in the end (delta: 24.1 MB). Free memory was 565.0 MB in the beginning and 640.9 MB in the end (delta: -75.9 MB). Peak memory consumption was 33.1 MB. Max. memory is 50.3 GB. 97.09/53.41 * Boogie Procedure Inliner took 46.26 ms. Allocated memory is still 673.7 MB. Free memory was 640.9 MB in the beginning and 636.5 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 50.3 GB. 97.09/53.41 * Boogie Preprocessor took 30.13 ms. Allocated memory is still 673.7 MB. Free memory was 636.5 MB in the beginning and 635.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 97.09/53.41 * RCFGBuilder took 402.62 ms. Allocated memory is still 673.7 MB. Free memory was 635.1 MB in the beginning and 604.8 MB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 50.3 GB. 97.09/53.41 * BlockEncodingV2 took 168.09 ms. Allocated memory is still 673.7 MB. Free memory was 604.8 MB in the beginning and 592.7 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. 97.09/53.41 * TraceAbstraction took 4148.55 ms. Allocated memory was 673.7 MB in the beginning and 763.4 MB in the end (delta: 89.7 MB). Free memory was 591.4 MB in the beginning and 722.2 MB in the end (delta: -130.9 MB). Peak memory consumption was 307.6 MB. Max. memory is 50.3 GB. 97.09/53.41 * BuchiAutomizer took 43922.09 ms. Allocated memory was 763.4 MB in the beginning and 1.3 GB in the end (delta: 545.3 MB). Free memory was 722.2 MB in the beginning and 595.0 MB in the end (delta: 127.3 MB). Peak memory consumption was 672.5 MB. Max. memory is 50.3 GB. 97.09/53.41 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 - GenericResult: Unfinished Backtranslation 97.09/53.41 unknown boogie variable #length 97.09/53.41 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 97.09/53.41 - PositiveResult [Line: 15]: pointer dereference always succeeds 97.09/53.41 For all program executions holds that pointer dereference always succeeds at this location 97.09/53.41 - PositiveResult [Line: 20]: pointer dereference always succeeds 97.09/53.41 For all program executions holds that pointer dereference always succeeds at this location 97.09/53.41 - PositiveResult [Line: 15]: pointer dereference always succeeds 97.09/53.41 For all program executions holds that pointer dereference always succeeds at this location 97.09/53.41 - PositiveResult [Line: 20]: pointer dereference always succeeds 97.09/53.41 For all program executions holds that pointer dereference always succeeds at this location 97.09/53.41 - PositiveResult [Line: 19]: pointer dereference always succeeds 97.09/53.41 For all program executions holds that pointer dereference always succeeds at this location 97.09/53.41 - PositiveResult [Line: 20]: pointer dereference always succeeds 97.09/53.41 For all program executions holds that pointer dereference always succeeds at this location 97.09/53.41 - PositiveResult [Line: 24]: pointer dereference always succeeds 97.09/53.41 For all program executions holds that pointer dereference always succeeds at this location 97.09/53.41 - PositiveResult [Line: 19]: pointer dereference always succeeds 97.09/53.41 For all program executions holds that pointer dereference always succeeds at this location 97.09/53.41 - PositiveResult [Line: 15]: pointer dereference always succeeds 97.09/53.41 For all program executions holds that pointer dereference always succeeds at this location 97.09/53.41 - PositiveResult [Line: 19]: pointer dereference always succeeds 97.09/53.41 For all program executions holds that pointer dereference always succeeds at this location 97.09/53.41 - PositiveResult [Line: 15]: pointer dereference always succeeds 97.09/53.41 For all program executions holds that pointer dereference always succeeds at this location 97.09/53.41 - PositiveResult [Line: 20]: pointer dereference always succeeds 97.09/53.41 For all program executions holds that pointer dereference always succeeds at this location 97.09/53.41 - PositiveResult [Line: 23]: pointer dereference always succeeds 97.09/53.41 For all program executions holds that pointer dereference always succeeds at this location 97.09/53.41 - PositiveResult [Line: 23]: pointer dereference always succeeds 97.09/53.41 For all program executions holds that pointer dereference always succeeds at this location 97.09/53.41 - PositiveResult [Line: 19]: pointer dereference always succeeds 97.09/53.41 For all program executions holds that pointer dereference always succeeds at this location 97.09/53.41 - PositiveResult [Line: 19]: pointer dereference always succeeds 97.09/53.41 For all program executions holds that pointer dereference always succeeds at this location 97.09/53.41 - PositiveResult [Line: 24]: pointer dereference always succeeds 97.09/53.41 For all program executions holds that pointer dereference always succeeds at this location 97.09/53.41 - PositiveResult [Line: 19]: pointer dereference always succeeds 97.09/53.41 For all program executions holds that pointer dereference always succeeds at this location 97.09/53.41 - PositiveResult [Line: 20]: pointer dereference always succeeds 97.09/53.41 For all program executions holds that pointer dereference always succeeds at this location 97.09/53.41 - PositiveResult [Line: 19]: pointer dereference always succeeds 97.09/53.41 For all program executions holds that pointer dereference always succeeds at this location 97.09/53.41 - PositiveResult [Line: 20]: pointer dereference always succeeds 97.09/53.41 For all program executions holds that pointer dereference always succeeds at this location 97.09/53.41 - PositiveResult [Line: 19]: pointer dereference always succeeds 97.09/53.41 For all program executions holds that pointer dereference always succeeds at this location 97.09/53.41 - AllSpecificationsHoldResult: All specifications hold 97.09/53.41 22 specifications checked. All of them hold 97.09/53.41 - InvariantResult [Line: 18]: Loop Invariant 97.09/53.41 [2019-03-28 12:44:04,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,907 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,908 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,908 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,908 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,908 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,909 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,909 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,909 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,909 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 Derived loop invariant: ((((((((((((4 * N <= unknown-#length-unknown[a] && unknown-#length-unknown[prev] == 4 * N) && 1 == \valid[best]) && 1 == \valid[a]) && 4 * i + 4 <= unknown-#length-unknown[best]) && 0 == best) && 0 == prev) && unknown-#length-unknown[best] == 4 * N) && 1 == i) && 1 == \valid[prev]) && 1 <= array_size) || ((((((((((4 * N <= unknown-#length-unknown[a] && unknown-#length-unknown[prev] == 4 * N) && 1 == \valid[best]) && 2 <= i) && 1 == \valid[a]) && 4 * i + 4 <= unknown-#length-unknown[best]) && 0 == best) && 0 == prev) && unknown-#length-unknown[best] == 4 * N) && 1 == \valid[prev]) && 1 <= array_size)) && 0 <= j) && a == 0 97.09/53.41 - InvariantResult [Line: 14]: Loop Invariant 97.09/53.41 [2019-03-28 12:44:04,910 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,910 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 Derived loop invariant: (((((((((0 == best && 0 == prev) && 4 * N <= unknown-#length-unknown[a]) && 0 <= i) && unknown-#length-unknown[prev] == 4 * N) && unknown-#length-unknown[best] == 4 * N) && 1 == \valid[best]) && 1 == \valid[prev]) && 1 <= array_size) && a == 0) && 1 == \valid[a] 97.09/53.41 - InvariantResult [Line: 22]: Loop Invariant 97.09/53.41 [2019-03-28 12:44:04,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 Derived loop invariant: (((((0 == best && 0 == prev) && 0 <= i) && unknown-#length-unknown[prev] == 4 * N) && unknown-#length-unknown[best] == 4 * N) && 1 == \valid[best]) && 1 == \valid[prev] 97.09/53.41 - InvariantResult [Line: 17]: Loop Invariant 97.09/53.41 [2019-03-28 12:44:04,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,918 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,918 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 [2019-03-28 12:44:04,918 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 97.09/53.41 Derived loop invariant: (((((((((((0 == best && 0 == prev) && 4 * N <= unknown-#length-unknown[a]) && unknown-#length-unknown[prev] == 4 * N) && unknown-#length-unknown[best] == 4 * N) && 1 == \valid[best]) && 1 == \valid[prev]) && 1 <= array_size) && a == 0) && 2 <= i) && 1 == \valid[a]) || ((((((((((0 == best && 0 == prev) && unknown-#length-unknown[prev] == 4 * N) && i <= 1) && unknown-#length-unknown[best] == 4 * N) && 1 == \valid[best]) && 1 == \valid[prev]) && 1 <= array_size) && 1 <= i) && N <= 1) && 1 == \valid[a])) || ((((((((((0 == best && 0 == prev) && 4 * N <= unknown-#length-unknown[a]) && unknown-#length-unknown[prev] == 4 * N) && unknown-#length-unknown[best] == 4 * N) && 1 == \valid[best]) && 1 == i) && 1 == \valid[prev]) && 1 <= array_size) && a == 0) && 1 == \valid[a]) 97.09/53.41 - StatisticsResult: Ultimate Automizer benchmark data 97.09/53.41 CFG has 1 procedures, 47 locations, 22 error locations. SAFE Result, 4.0s OverallTime, 18 OverallIterations, 2 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 246 SDtfs, 1013 SDslu, 298 SDs, 0 SdLazy, 1144 SolverSat, 213 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=12, 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.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 92 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 10 NumberOfFragments, 363 HoareAnnotationTreeSize, 4 FomulaSimplifications, 1001 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 166 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 8824 SizeOfPredicates, 3 NumberOfNonLiveVariables, 173 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 53/57 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 97.09/53.41 - StatisticsResult: Constructed decomposition of program 97.09/53.41 Your program was decomposed into 25 terminating modules (12 trivial, 0 deterministic, 13 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[prev] + -4 * i + -1 * prev and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[best] + -4 * i + -1 * best and consists of 4 locations. One nondeterministic module has affine ranking function -4 * i + unknown-#length-unknown[best] + -1 * best and consists of 4 locations. One nondeterministic module has affine ranking function -4 * i + unknown-#length-unknown[prev] + -1 * prev and consists of 3 locations. One nondeterministic module has affine ranking function -4 * i + -1 * best + unknown-#length-unknown[best] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * i + N and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i + N and consists of 3 locations. One nondeterministic module has affine ranking function -4 * i + -1 * prev + unknown-#length-unknown[prev] and consists of 3 locations. One nondeterministic module has affine ranking function -2 * i + 1 and consists of 6 locations. One nondeterministic module has affine ranking function -1 * j + i and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i + N and consists of 4 locations. One nondeterministic module has affine ranking function -1 * i + N and consists of 5 locations. One nondeterministic module has affine ranking function -1 * i + N and consists of 3 locations. 12 modules have a trivial ranking function, the largest among these consists of 26 locations. 97.09/53.41 - StatisticsResult: Timing statistics 97.09/53.41 BüchiAutomizer plugin needed 43.8s and 25 iterations. TraceHistogramMax:3. Analysis of lassos took 36.1s. Construction of modules took 2.9s. Büchi inclusion checks took 4.5s. Highest rank in rank-based complementation 3. Minimization of det autom 15. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 381 StatesRemovedByMinimization, 21 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 115 states and ocurred in iteration 21. Nontrivial modules had stage [13, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 566 SDtfs, 2074 SDslu, 958 SDs, 0 SdLazy, 3056 SolverSat, 418 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc4 concLT0 SILN0 SILU4 SILI2 SILT1 lasso12 LassoPreprocessingBenchmarks: Lassos: inital757 mio100 ax100 hnf100 lsp94 ukn67 mio100 lsp66 div100 bol100 ite100 ukn100 eq184 hnf80 smp97 dnf100 smp100 tf101 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 4 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s 97.09/53.41 - TerminationAnalysisResult: Termination proven 97.09/53.41 Buchi Automizer proved that your program is terminating 97.09/53.41 RESULT: Ultimate proved your program to be correct! 97.09/53.41 !SESSION 2019-03-28 12:43:12.560 ----------------------------------------------- 97.09/53.41 eclipse.buildId=unknown 97.09/53.41 java.version=1.8.0_181 97.09/53.41 java.vendor=Oracle Corporation 97.09/53.41 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 97.09/53.41 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 97.09/53.41 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 97.09/53.41 97.09/53.41 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:44:05.144 97.09/53.41 !MESSAGE The workspace will exit with unsaved changes in this session. 97.09/53.41 Received shutdown request... 97.09/53.41 Ultimate: 97.09/53.41 GTK+ Version Check 97.09/53.41 EOF