25.32/11.02 YES 25.32/11.02 25.32/11.02 Ultimate: Cannot open display: 25.32/11.02 This is Ultimate 0.1.24-8dc7c08-m 25.32/11.02 [2019-03-28 12:43:44,994 INFO L170 SettingsManager]: Resetting all preferences to default values... 25.32/11.02 [2019-03-28 12:43:44,996 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 25.32/11.02 [2019-03-28 12:43:45,008 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 25.32/11.02 [2019-03-28 12:43:45,008 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 25.32/11.02 [2019-03-28 12:43:45,009 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 25.32/11.02 [2019-03-28 12:43:45,010 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 25.32/11.02 [2019-03-28 12:43:45,012 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 25.32/11.02 [2019-03-28 12:43:45,013 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 25.32/11.02 [2019-03-28 12:43:45,014 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 25.32/11.02 [2019-03-28 12:43:45,015 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 25.32/11.02 [2019-03-28 12:43:45,015 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 25.32/11.02 [2019-03-28 12:43:45,016 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 25.32/11.02 [2019-03-28 12:43:45,017 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 25.32/11.02 [2019-03-28 12:43:45,018 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 25.32/11.02 [2019-03-28 12:43:45,019 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 25.32/11.02 [2019-03-28 12:43:45,020 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 25.32/11.02 [2019-03-28 12:43:45,021 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 25.32/11.02 [2019-03-28 12:43:45,023 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 25.32/11.02 [2019-03-28 12:43:45,024 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 25.32/11.02 [2019-03-28 12:43:45,025 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 25.32/11.02 [2019-03-28 12:43:45,027 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 25.32/11.02 [2019-03-28 12:43:45,029 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 25.32/11.02 [2019-03-28 12:43:45,029 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 25.32/11.02 [2019-03-28 12:43:45,029 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 25.32/11.02 [2019-03-28 12:43:45,030 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 25.32/11.02 [2019-03-28 12:43:45,030 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 25.32/11.02 [2019-03-28 12:43:45,031 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 25.32/11.02 [2019-03-28 12:43:45,031 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 25.32/11.02 [2019-03-28 12:43:45,032 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 25.32/11.02 [2019-03-28 12:43:45,033 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 25.32/11.02 [2019-03-28 12:43:45,033 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 25.32/11.02 [2019-03-28 12:43:45,034 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 25.32/11.02 [2019-03-28 12:43:45,035 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 25.32/11.02 [2019-03-28 12:43:45,035 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 25.32/11.02 [2019-03-28 12:43:45,035 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 25.32/11.02 [2019-03-28 12:43:45,036 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 25.32/11.02 [2019-03-28 12:43:45,037 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 25.32/11.02 [2019-03-28 12:43:45,037 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 25.32/11.02 [2019-03-28 12:43:45,037 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 25.32/11.02 [2019-03-28 12:43:45,052 INFO L110 SettingsManager]: Loading preferences was successful 25.32/11.02 [2019-03-28 12:43:45,052 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 25.32/11.02 [2019-03-28 12:43:45,053 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 25.32/11.02 [2019-03-28 12:43:45,054 INFO L133 SettingsManager]: * Rewrite not-equals=true 25.32/11.02 [2019-03-28 12:43:45,054 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 25.32/11.02 [2019-03-28 12:43:45,054 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 25.32/11.02 [2019-03-28 12:43:45,054 INFO L133 SettingsManager]: * Use SBE=true 25.32/11.02 [2019-03-28 12:43:45,054 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 25.32/11.02 [2019-03-28 12:43:45,055 INFO L133 SettingsManager]: * Use old map elimination=false 25.32/11.02 [2019-03-28 12:43:45,055 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 25.32/11.02 [2019-03-28 12:43:45,055 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 25.32/11.02 [2019-03-28 12:43:45,055 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 25.32/11.02 [2019-03-28 12:43:45,055 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 25.32/11.02 [2019-03-28 12:43:45,055 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 25.32/11.02 [2019-03-28 12:43:45,056 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.32/11.02 [2019-03-28 12:43:45,056 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 25.32/11.02 [2019-03-28 12:43:45,056 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 25.32/11.02 [2019-03-28 12:43:45,056 INFO L133 SettingsManager]: * Check division by zero=IGNORE 25.32/11.02 [2019-03-28 12:43:45,056 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 25.32/11.02 [2019-03-28 12:43:45,056 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 25.32/11.02 [2019-03-28 12:43:45,057 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 25.32/11.02 [2019-03-28 12:43:45,057 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 25.32/11.02 [2019-03-28 12:43:45,057 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 25.32/11.02 [2019-03-28 12:43:45,057 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 25.32/11.02 [2019-03-28 12:43:45,057 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 25.32/11.02 [2019-03-28 12:43:45,058 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 25.32/11.02 [2019-03-28 12:43:45,058 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 25.32/11.02 [2019-03-28 12:43:45,058 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 25.32/11.02 [2019-03-28 12:43:45,058 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 25.32/11.02 [2019-03-28 12:43:45,083 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 25.32/11.02 [2019-03-28 12:43:45,096 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 25.32/11.02 [2019-03-28 12:43:45,100 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 25.32/11.02 [2019-03-28 12:43:45,101 INFO L271 PluginConnector]: Initializing CDTParser... 25.32/11.02 [2019-03-28 12:43:45,102 INFO L276 PluginConnector]: CDTParser initialized 25.32/11.02 [2019-03-28 12:43:45,102 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 25.32/11.02 [2019-03-28 12:43:45,166 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/e1b0333e717b4b48ad4f84f1ca16bd0b/FLAG5bbc0f991 25.32/11.02 [2019-03-28 12:43:45,505 INFO L307 CDTParser]: Found 1 translation units. 25.32/11.02 [2019-03-28 12:43:45,505 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 25.32/11.02 [2019-03-28 12:43:45,506 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 25.32/11.02 [2019-03-28 12:43:45,512 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/e1b0333e717b4b48ad4f84f1ca16bd0b/FLAG5bbc0f991 25.32/11.02 [2019-03-28 12:43:45,902 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/e1b0333e717b4b48ad4f84f1ca16bd0b 25.32/11.02 [2019-03-28 12:43:45,913 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 25.32/11.02 [2019-03-28 12:43:45,915 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 25.32/11.02 [2019-03-28 12:43:45,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 25.32/11.02 [2019-03-28 12:43:45,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 25.32/11.02 [2019-03-28 12:43:45,920 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 25.32/11.02 [2019-03-28 12:43:45,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:43:45" (1/1) ... 25.32/11.02 [2019-03-28 12:43:45,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d705576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:45, skipping insertion in model container 25.32/11.02 [2019-03-28 12:43:45,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:43:45" (1/1) ... 25.32/11.02 [2019-03-28 12:43:45,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 25.32/11.02 [2019-03-28 12:43:45,950 INFO L176 MainTranslator]: Built tables and reachable declarations 25.32/11.02 [2019-03-28 12:43:46,116 INFO L206 PostProcessor]: Analyzing one entry point: main 25.32/11.02 [2019-03-28 12:43:46,129 INFO L191 MainTranslator]: Completed pre-run 25.32/11.02 [2019-03-28 12:43:46,149 INFO L206 PostProcessor]: Analyzing one entry point: main 25.32/11.02 [2019-03-28 12:43:46,224 INFO L195 MainTranslator]: Completed translation 25.32/11.02 [2019-03-28 12:43:46,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:46 WrapperNode 25.32/11.02 [2019-03-28 12:43:46,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 25.32/11.02 [2019-03-28 12:43:46,225 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 25.32/11.02 [2019-03-28 12:43:46,225 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 25.32/11.02 [2019-03-28 12:43:46,226 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 25.32/11.02 [2019-03-28 12:43:46,236 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:46" (1/1) ... 25.32/11.02 [2019-03-28 12:43:46,245 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:46" (1/1) ... 25.32/11.02 [2019-03-28 12:43:46,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 25.32/11.02 [2019-03-28 12:43:46,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 25.32/11.02 [2019-03-28 12:43:46,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 25.32/11.02 [2019-03-28 12:43:46,269 INFO L276 PluginConnector]: Boogie Preprocessor initialized 25.32/11.02 [2019-03-28 12:43:46,279 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:46" (1/1) ... 25.32/11.02 [2019-03-28 12:43:46,279 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:46" (1/1) ... 25.32/11.02 [2019-03-28 12:43:46,281 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:46" (1/1) ... 25.32/11.02 [2019-03-28 12:43:46,281 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:46" (1/1) ... 25.32/11.02 [2019-03-28 12:43:46,287 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:46" (1/1) ... 25.32/11.02 [2019-03-28 12:43:46,292 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:46" (1/1) ... 25.32/11.02 [2019-03-28 12:43:46,293 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:46" (1/1) ... 25.32/11.02 [2019-03-28 12:43:46,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 25.32/11.02 [2019-03-28 12:43:46,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 25.32/11.02 [2019-03-28 12:43:46,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... 25.32/11.02 [2019-03-28 12:43:46,296 INFO L276 PluginConnector]: RCFGBuilder initialized 25.32/11.02 [2019-03-28 12:43:46,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:46" (1/1) ... 25.32/11.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.32/11.02 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 25.32/11.02 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 25.32/11.02 [2019-03-28 12:43:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 25.32/11.02 [2019-03-28 12:43:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 25.32/11.02 [2019-03-28 12:43:46,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 25.32/11.02 [2019-03-28 12:43:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 25.32/11.02 [2019-03-28 12:43:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 25.32/11.02 [2019-03-28 12:43:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 25.32/11.02 [2019-03-28 12:43:46,607 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 25.32/11.02 [2019-03-28 12:43:46,608 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. 25.32/11.02 [2019-03-28 12:43:46,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:43:46 BoogieIcfgContainer 25.32/11.02 [2019-03-28 12:43:46,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 25.32/11.02 [2019-03-28 12:43:46,610 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 25.32/11.02 [2019-03-28 12:43:46,610 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 25.32/11.02 [2019-03-28 12:43:46,612 INFO L276 PluginConnector]: BlockEncodingV2 initialized 25.32/11.02 [2019-03-28 12:43:46,613 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:43:46" (1/1) ... 25.32/11.02 [2019-03-28 12:43:46,632 INFO L313 BlockEncoder]: Initial Icfg 32 locations, 37 edges 25.32/11.02 [2019-03-28 12:43:46,634 INFO L258 BlockEncoder]: Using Remove infeasible edges 25.32/11.02 [2019-03-28 12:43:46,637 INFO L263 BlockEncoder]: Using Maximize final states 25.32/11.02 [2019-03-28 12:43:46,638 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 25.32/11.02 [2019-03-28 12:43:46,638 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 25.32/11.02 [2019-03-28 12:43:46,640 INFO L296 BlockEncoder]: Using Remove sink states 25.32/11.02 [2019-03-28 12:43:46,641 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 25.32/11.02 [2019-03-28 12:43:46,641 INFO L179 BlockEncoder]: Using Rewrite not-equals 25.32/11.02 [2019-03-28 12:43:46,666 INFO L185 BlockEncoder]: Using Use SBE 25.32/11.02 [2019-03-28 12:43:46,692 INFO L200 BlockEncoder]: SBE split 13 edges 25.32/11.02 [2019-03-28 12:43:46,697 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 25.32/11.02 [2019-03-28 12:43:46,699 INFO L71 MaximizeFinalStates]: 0 new accepting states 25.32/11.02 [2019-03-28 12:43:46,740 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding 25.32/11.02 [2019-03-28 12:43:46,742 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 25.32/11.02 [2019-03-28 12:43:46,744 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 25.32/11.02 [2019-03-28 12:43:46,744 INFO L71 MaximizeFinalStates]: 0 new accepting states 25.32/11.02 [2019-03-28 12:43:46,745 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 25.32/11.02 [2019-03-28 12:43:46,745 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 25.32/11.02 [2019-03-28 12:43:46,746 INFO L313 BlockEncoder]: Encoded RCFG 23 locations, 39 edges 25.32/11.02 [2019-03-28 12:43:46,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:43:46 BasicIcfg 25.32/11.02 [2019-03-28 12:43:46,746 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 25.32/11.02 [2019-03-28 12:43:46,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 25.32/11.02 [2019-03-28 12:43:46,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... 25.32/11.02 [2019-03-28 12:43:46,751 INFO L276 PluginConnector]: TraceAbstraction initialized 25.32/11.02 [2019-03-28 12:43:46,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:43:45" (1/4) ... 25.32/11.02 [2019-03-28 12:43:46,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9f21ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:43:46, skipping insertion in model container 25.32/11.02 [2019-03-28 12:43:46,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:46" (2/4) ... 25.32/11.02 [2019-03-28 12:43:46,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9f21ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:43:46, skipping insertion in model container 25.32/11.02 [2019-03-28 12:43:46,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:43:46" (3/4) ... 25.32/11.02 [2019-03-28 12:43:46,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9f21ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:43:46, skipping insertion in model container 25.32/11.02 [2019-03-28 12:43:46,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:43:46" (4/4) ... 25.32/11.02 [2019-03-28 12:43:46,755 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 25.32/11.02 [2019-03-28 12:43:46,765 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 25.32/11.02 [2019-03-28 12:43:46,773 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. 25.32/11.02 [2019-03-28 12:43:46,790 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. 25.32/11.02 [2019-03-28 12:43:46,819 INFO L133 ementStrategyFactory]: Using default assertion order modulation 25.32/11.02 [2019-03-28 12:43:46,820 INFO L382 AbstractCegarLoop]: Interprodecural is true 25.32/11.02 [2019-03-28 12:43:46,820 INFO L383 AbstractCegarLoop]: Hoare is true 25.32/11.02 [2019-03-28 12:43:46,820 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 25.32/11.02 [2019-03-28 12:43:46,820 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 25.32/11.02 [2019-03-28 12:43:46,820 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 25.32/11.02 [2019-03-28 12:43:46,820 INFO L387 AbstractCegarLoop]: Difference is false 25.32/11.02 [2019-03-28 12:43:46,821 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 25.32/11.02 [2019-03-28 12:43:46,821 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 25.32/11.02 [2019-03-28 12:43:46,836 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. 25.32/11.02 [2019-03-28 12:43:46,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 25.32/11.02 [2019-03-28 12:43:46,842 INFO L394 BasicCegarLoop]: Found error trace 25.32/11.02 [2019-03-28 12:43:46,842 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 25.32/11.02 [2019-03-28 12:43:46,843 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 25.32/11.02 [2019-03-28 12:43:46,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:46,848 INFO L82 PathProgramCache]: Analyzing trace with hash 163846899, now seen corresponding path program 1 times 25.32/11.02 [2019-03-28 12:43:46,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:46,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:46,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:46,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:46,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.02 [2019-03-28 12:43:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.32/11.02 [2019-03-28 12:43:47,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.32/11.02 [2019-03-28 12:43:47,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.32/11.02 [2019-03-28 12:43:47,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 25.32/11.02 [2019-03-28 12:43:47,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.32/11.02 [2019-03-28 12:43:47,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.32/11.02 [2019-03-28 12:43:47,038 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. 25.32/11.02 [2019-03-28 12:43:47,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.32/11.02 [2019-03-28 12:43:47,135 INFO L93 Difference]: Finished difference Result 23 states and 39 transitions. 25.32/11.02 [2019-03-28 12:43:47,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.32/11.02 [2019-03-28 12:43:47,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 25.32/11.02 [2019-03-28 12:43:47,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.32/11.02 [2019-03-28 12:43:47,148 INFO L225 Difference]: With dead ends: 23 25.32/11.02 [2019-03-28 12:43:47,149 INFO L226 Difference]: Without dead ends: 18 25.32/11.02 [2019-03-28 12:43:47,152 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 25.32/11.02 [2019-03-28 12:43:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 25.32/11.02 [2019-03-28 12:43:47,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 25.32/11.02 [2019-03-28 12:43:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 25.32/11.02 [2019-03-28 12:43:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. 25.32/11.02 [2019-03-28 12:43:47,190 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 29 transitions. Word has length 5 25.32/11.02 [2019-03-28 12:43:47,190 INFO L84 Accepts]: Finished accepts. word is rejected. 25.32/11.02 [2019-03-28 12:43:47,191 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 29 transitions. 25.32/11.02 [2019-03-28 12:43:47,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 25.32/11.02 [2019-03-28 12:43:47,191 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. 25.32/11.02 [2019-03-28 12:43:47,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 25.32/11.02 [2019-03-28 12:43:47,191 INFO L394 BasicCegarLoop]: Found error trace 25.32/11.02 [2019-03-28 12:43:47,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 25.32/11.02 [2019-03-28 12:43:47,192 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 25.32/11.02 [2019-03-28 12:43:47,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:47,192 INFO L82 PathProgramCache]: Analyzing trace with hash 163846901, now seen corresponding path program 1 times 25.32/11.02 [2019-03-28 12:43:47,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:47,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:47,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:47,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:47,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.02 [2019-03-28 12:43:47,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.32/11.02 [2019-03-28 12:43:47,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.32/11.02 [2019-03-28 12:43:47,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.32/11.02 [2019-03-28 12:43:47,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 25.32/11.02 [2019-03-28 12:43:47,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.32/11.02 [2019-03-28 12:43:47,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.32/11.02 [2019-03-28 12:43:47,225 INFO L87 Difference]: Start difference. First operand 18 states and 29 transitions. Second operand 3 states. 25.32/11.02 [2019-03-28 12:43:47,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.32/11.02 [2019-03-28 12:43:47,291 INFO L93 Difference]: Finished difference Result 19 states and 29 transitions. 25.32/11.02 [2019-03-28 12:43:47,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.32/11.02 [2019-03-28 12:43:47,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 25.32/11.02 [2019-03-28 12:43:47,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.32/11.02 [2019-03-28 12:43:47,292 INFO L225 Difference]: With dead ends: 19 25.32/11.02 [2019-03-28 12:43:47,292 INFO L226 Difference]: Without dead ends: 18 25.32/11.02 [2019-03-28 12:43:47,293 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 25.32/11.02 [2019-03-28 12:43:47,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 25.32/11.02 [2019-03-28 12:43:47,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 25.32/11.02 [2019-03-28 12:43:47,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 25.32/11.02 [2019-03-28 12:43:47,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. 25.32/11.02 [2019-03-28 12:43:47,297 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 28 transitions. Word has length 5 25.32/11.02 [2019-03-28 12:43:47,297 INFO L84 Accepts]: Finished accepts. word is rejected. 25.32/11.02 [2019-03-28 12:43:47,297 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 28 transitions. 25.32/11.02 [2019-03-28 12:43:47,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 25.32/11.02 [2019-03-28 12:43:47,298 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 28 transitions. 25.32/11.02 [2019-03-28 12:43:47,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 25.32/11.02 [2019-03-28 12:43:47,298 INFO L394 BasicCegarLoop]: Found error trace 25.32/11.02 [2019-03-28 12:43:47,298 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 25.32/11.02 [2019-03-28 12:43:47,299 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 25.32/11.02 [2019-03-28 12:43:47,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:47,299 INFO L82 PathProgramCache]: Analyzing trace with hash 163846902, now seen corresponding path program 1 times 25.32/11.02 [2019-03-28 12:43:47,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:47,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:47,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:47,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:47,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.02 [2019-03-28 12:43:47,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.32/11.02 [2019-03-28 12:43:47,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.32/11.02 [2019-03-28 12:43:47,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.32/11.02 [2019-03-28 12:43:47,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 25.32/11.02 [2019-03-28 12:43:47,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 25.32/11.02 [2019-03-28 12:43:47,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 25.32/11.02 [2019-03-28 12:43:47,364 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. Second operand 4 states. 25.32/11.02 [2019-03-28 12:43:47,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.32/11.02 [2019-03-28 12:43:47,429 INFO L93 Difference]: Finished difference Result 18 states and 28 transitions. 25.32/11.02 [2019-03-28 12:43:47,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 25.32/11.02 [2019-03-28 12:43:47,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 25.32/11.02 [2019-03-28 12:43:47,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.32/11.02 [2019-03-28 12:43:47,430 INFO L225 Difference]: With dead ends: 18 25.32/11.02 [2019-03-28 12:43:47,430 INFO L226 Difference]: Without dead ends: 17 25.32/11.02 [2019-03-28 12:43:47,431 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 25.32/11.02 [2019-03-28 12:43:47,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 25.32/11.02 [2019-03-28 12:43:47,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 25.32/11.02 [2019-03-28 12:43:47,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 25.32/11.02 [2019-03-28 12:43:47,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 27 transitions. 25.32/11.02 [2019-03-28 12:43:47,434 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 27 transitions. Word has length 5 25.32/11.02 [2019-03-28 12:43:47,435 INFO L84 Accepts]: Finished accepts. word is rejected. 25.32/11.02 [2019-03-28 12:43:47,435 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 27 transitions. 25.32/11.02 [2019-03-28 12:43:47,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 25.32/11.02 [2019-03-28 12:43:47,435 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 27 transitions. 25.32/11.02 [2019-03-28 12:43:47,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 25.32/11.02 [2019-03-28 12:43:47,436 INFO L394 BasicCegarLoop]: Found error trace 25.32/11.02 [2019-03-28 12:43:47,436 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 25.32/11.02 [2019-03-28 12:43:47,436 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 25.32/11.02 [2019-03-28 12:43:47,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:47,436 INFO L82 PathProgramCache]: Analyzing trace with hash 2081015822, now seen corresponding path program 1 times 25.32/11.02 [2019-03-28 12:43:47,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:47,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:47,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:47,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:47,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.02 [2019-03-28 12:43:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.32/11.02 [2019-03-28 12:43:47,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.32/11.02 [2019-03-28 12:43:47,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 25.32/11.02 [2019-03-28 12:43:47,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 25.32/11.02 [2019-03-28 12:43:47,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 25.32/11.02 [2019-03-28 12:43:47,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 25.32/11.02 [2019-03-28 12:43:47,468 INFO L87 Difference]: Start difference. First operand 17 states and 27 transitions. Second operand 4 states. 25.32/11.02 [2019-03-28 12:43:47,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.32/11.02 [2019-03-28 12:43:47,558 INFO L93 Difference]: Finished difference Result 45 states and 71 transitions. 25.32/11.02 [2019-03-28 12:43:47,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 25.32/11.02 [2019-03-28 12:43:47,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 25.32/11.02 [2019-03-28 12:43:47,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.32/11.02 [2019-03-28 12:43:47,560 INFO L225 Difference]: With dead ends: 45 25.32/11.02 [2019-03-28 12:43:47,560 INFO L226 Difference]: Without dead ends: 31 25.32/11.02 [2019-03-28 12:43:47,561 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 25.32/11.02 [2019-03-28 12:43:47,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 25.32/11.02 [2019-03-28 12:43:47,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. 25.32/11.02 [2019-03-28 12:43:47,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 25.32/11.02 [2019-03-28 12:43:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. 25.32/11.02 [2019-03-28 12:43:47,566 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 28 transitions. Word has length 8 25.32/11.02 [2019-03-28 12:43:47,566 INFO L84 Accepts]: Finished accepts. word is rejected. 25.32/11.02 [2019-03-28 12:43:47,566 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 28 transitions. 25.32/11.02 [2019-03-28 12:43:47,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 25.32/11.02 [2019-03-28 12:43:47,566 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 28 transitions. 25.32/11.02 [2019-03-28 12:43:47,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 25.32/11.02 [2019-03-28 12:43:47,567 INFO L394 BasicCegarLoop]: Found error trace 25.32/11.02 [2019-03-28 12:43:47,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 25.32/11.02 [2019-03-28 12:43:47,567 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 25.32/11.02 [2019-03-28 12:43:47,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:47,568 INFO L82 PathProgramCache]: Analyzing trace with hash 2081016783, now seen corresponding path program 1 times 25.32/11.02 [2019-03-28 12:43:47,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:47,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:47,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:47,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:47,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.02 [2019-03-28 12:43:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.32/11.02 [2019-03-28 12:43:47,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.32/11.02 [2019-03-28 12:43:47,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.32/11.02 [2019-03-28 12:43:47,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 25.32/11.02 [2019-03-28 12:43:47,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 25.32/11.02 [2019-03-28 12:43:47,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 25.32/11.02 [2019-03-28 12:43:47,606 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. Second operand 4 states. 25.32/11.02 [2019-03-28 12:43:47,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.32/11.02 [2019-03-28 12:43:47,668 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. 25.32/11.02 [2019-03-28 12:43:47,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 25.32/11.02 [2019-03-28 12:43:47,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 25.32/11.02 [2019-03-28 12:43:47,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.32/11.02 [2019-03-28 12:43:47,669 INFO L225 Difference]: With dead ends: 32 25.32/11.02 [2019-03-28 12:43:47,670 INFO L226 Difference]: Without dead ends: 28 25.32/11.02 [2019-03-28 12:43:47,670 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 25.32/11.02 [2019-03-28 12:43:47,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 25.32/11.02 [2019-03-28 12:43:47,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. 25.32/11.02 [2019-03-28 12:43:47,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 25.32/11.02 [2019-03-28 12:43:47,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. 25.32/11.02 [2019-03-28 12:43:47,675 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 37 transitions. Word has length 8 25.32/11.02 [2019-03-28 12:43:47,675 INFO L84 Accepts]: Finished accepts. word is rejected. 25.32/11.02 [2019-03-28 12:43:47,675 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 37 transitions. 25.32/11.02 [2019-03-28 12:43:47,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 25.32/11.02 [2019-03-28 12:43:47,675 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 37 transitions. 25.32/11.02 [2019-03-28 12:43:47,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 25.32/11.02 [2019-03-28 12:43:47,676 INFO L394 BasicCegarLoop]: Found error trace 25.32/11.02 [2019-03-28 12:43:47,676 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 25.32/11.02 [2019-03-28 12:43:47,676 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 25.32/11.02 [2019-03-28 12:43:47,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:47,676 INFO L82 PathProgramCache]: Analyzing trace with hash 2081016784, now seen corresponding path program 1 times 25.32/11.02 [2019-03-28 12:43:47,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:47,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:47,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:47,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:47,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.02 [2019-03-28 12:43:47,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.32/11.02 [2019-03-28 12:43:47,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.32/11.02 [2019-03-28 12:43:47,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 25.32/11.02 [2019-03-28 12:43:47,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 25.32/11.02 [2019-03-28 12:43:47,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 25.32/11.02 [2019-03-28 12:43:47,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 25.32/11.02 [2019-03-28 12:43:47,741 INFO L87 Difference]: Start difference. First operand 23 states and 37 transitions. Second operand 5 states. 25.32/11.02 [2019-03-28 12:43:47,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.32/11.02 [2019-03-28 12:43:47,855 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. 25.32/11.02 [2019-03-28 12:43:47,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 25.32/11.02 [2019-03-28 12:43:47,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 25.32/11.02 [2019-03-28 12:43:47,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.32/11.02 [2019-03-28 12:43:47,856 INFO L225 Difference]: With dead ends: 28 25.32/11.02 [2019-03-28 12:43:47,856 INFO L226 Difference]: Without dead ends: 24 25.32/11.02 [2019-03-28 12:43:47,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 25.32/11.02 [2019-03-28 12:43:47,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 25.32/11.02 [2019-03-28 12:43:47,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. 25.32/11.02 [2019-03-28 12:43:47,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 25.32/11.02 [2019-03-28 12:43:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. 25.32/11.02 [2019-03-28 12:43:47,861 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 8 25.32/11.02 [2019-03-28 12:43:47,861 INFO L84 Accepts]: Finished accepts. word is rejected. 25.32/11.02 [2019-03-28 12:43:47,862 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. 25.32/11.02 [2019-03-28 12:43:47,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 25.32/11.02 [2019-03-28 12:43:47,862 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. 25.32/11.02 [2019-03-28 12:43:47,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 25.32/11.02 [2019-03-28 12:43:47,863 INFO L394 BasicCegarLoop]: Found error trace 25.32/11.02 [2019-03-28 12:43:47,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 25.32/11.02 [2019-03-28 12:43:47,863 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 25.32/11.02 [2019-03-28 12:43:47,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:47,864 INFO L82 PathProgramCache]: Analyzing trace with hash 924842442, now seen corresponding path program 1 times 25.32/11.02 [2019-03-28 12:43:47,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:47,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:47,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:47,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:47,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.02 [2019-03-28 12:43:47,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.32/11.02 [2019-03-28 12:43:47,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.32/11.02 [2019-03-28 12:43:47,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.32/11.02 [2019-03-28 12:43:47,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 25.32/11.02 [2019-03-28 12:43:47,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.32/11.02 [2019-03-28 12:43:47,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.32/11.02 [2019-03-28 12:43:47,897 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand 3 states. 25.32/11.02 [2019-03-28 12:43:47,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.32/11.02 [2019-03-28 12:43:47,926 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. 25.32/11.02 [2019-03-28 12:43:47,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.32/11.02 [2019-03-28 12:43:47,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 25.32/11.02 [2019-03-28 12:43:47,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.32/11.02 [2019-03-28 12:43:47,929 INFO L225 Difference]: With dead ends: 42 25.32/11.02 [2019-03-28 12:43:47,930 INFO L226 Difference]: Without dead ends: 23 25.32/11.02 [2019-03-28 12:43:47,930 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 25.32/11.02 [2019-03-28 12:43:47,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. 25.32/11.02 [2019-03-28 12:43:47,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. 25.32/11.02 [2019-03-28 12:43:47,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 25.32/11.02 [2019-03-28 12:43:47,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. 25.32/11.02 [2019-03-28 12:43:47,935 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 13 25.32/11.02 [2019-03-28 12:43:47,936 INFO L84 Accepts]: Finished accepts. word is rejected. 25.32/11.02 [2019-03-28 12:43:47,936 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. 25.32/11.02 [2019-03-28 12:43:47,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 25.32/11.02 [2019-03-28 12:43:47,936 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. 25.32/11.02 [2019-03-28 12:43:47,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 25.32/11.02 [2019-03-28 12:43:47,937 INFO L394 BasicCegarLoop]: Found error trace 25.32/11.02 [2019-03-28 12:43:47,937 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 25.32/11.02 [2019-03-28 12:43:47,937 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 25.32/11.02 [2019-03-28 12:43:47,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:47,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1470140232, now seen corresponding path program 1 times 25.32/11.02 [2019-03-28 12:43:47,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:47,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:47,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:47,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:47,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.02 [2019-03-28 12:43:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 25.32/11.02 [2019-03-28 12:43:47,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.32/11.02 [2019-03-28 12:43:47,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.32/11.02 [2019-03-28 12:43:47,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 25.32/11.02 [2019-03-28 12:43:47,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.32/11.02 [2019-03-28 12:43:47,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.32/11.02 [2019-03-28 12:43:47,970 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand 3 states. 25.32/11.02 [2019-03-28 12:43:48,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.32/11.02 [2019-03-28 12:43:48,003 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. 25.32/11.02 [2019-03-28 12:43:48,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.32/11.02 [2019-03-28 12:43:48,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 25.32/11.02 [2019-03-28 12:43:48,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.32/11.02 [2019-03-28 12:43:48,004 INFO L225 Difference]: With dead ends: 39 25.32/11.02 [2019-03-28 12:43:48,004 INFO L226 Difference]: Without dead ends: 19 25.32/11.02 [2019-03-28 12:43:48,005 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 25.32/11.02 [2019-03-28 12:43:48,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. 25.32/11.02 [2019-03-28 12:43:48,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. 25.32/11.02 [2019-03-28 12:43:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 25.32/11.02 [2019-03-28 12:43:48,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. 25.32/11.02 [2019-03-28 12:43:48,008 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 15 25.32/11.02 [2019-03-28 12:43:48,009 INFO L84 Accepts]: Finished accepts. word is rejected. 25.32/11.02 [2019-03-28 12:43:48,009 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. 25.32/11.02 [2019-03-28 12:43:48,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 25.32/11.02 [2019-03-28 12:43:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. 25.32/11.02 [2019-03-28 12:43:48,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 25.32/11.02 [2019-03-28 12:43:48,010 INFO L394 BasicCegarLoop]: Found error trace 25.32/11.02 [2019-03-28 12:43:48,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 25.32/11.02 [2019-03-28 12:43:48,010 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 25.32/11.02 [2019-03-28 12:43:48,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:48,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1670293991, now seen corresponding path program 1 times 25.32/11.02 [2019-03-28 12:43:48,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:48,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:48,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.02 [2019-03-28 12:43:48,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.32/11.02 [2019-03-28 12:43:48,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 25.32/11.02 [2019-03-28 12:43:48,080 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 25.32/11.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.32/11.02 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 25.32/11.02 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 25.32/11.02 [2019-03-28 12:43:48,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.02 [2019-03-28 12:43:48,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core 25.32/11.02 [2019-03-28 12:43:48,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.32/11.02 [2019-03-28 12:43:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.32/11.02 [2019-03-28 12:43:48,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 25.32/11.02 [2019-03-28 12:43:48,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 25.32/11.02 [2019-03-28 12:43:48,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 25.32/11.02 [2019-03-28 12:43:48,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 25.32/11.02 [2019-03-28 12:43:48,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 25.32/11.02 [2019-03-28 12:43:48,201 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 8 states. 25.32/11.02 [2019-03-28 12:43:48,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.32/11.02 [2019-03-28 12:43:48,252 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. 25.32/11.02 [2019-03-28 12:43:48,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 25.32/11.02 [2019-03-28 12:43:48,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 25.32/11.02 [2019-03-28 12:43:48,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.32/11.02 [2019-03-28 12:43:48,253 INFO L225 Difference]: With dead ends: 23 25.32/11.02 [2019-03-28 12:43:48,254 INFO L226 Difference]: Without dead ends: 0 25.32/11.02 [2019-03-28 12:43:48,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 25.32/11.02 [2019-03-28 12:43:48,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 25.32/11.02 [2019-03-28 12:43:48,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 25.32/11.02 [2019-03-28 12:43:48,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 25.32/11.02 [2019-03-28 12:43:48,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 25.32/11.02 [2019-03-28 12:43:48,255 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 25.32/11.02 [2019-03-28 12:43:48,255 INFO L84 Accepts]: Finished accepts. word is rejected. 25.32/11.02 [2019-03-28 12:43:48,255 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 25.32/11.02 [2019-03-28 12:43:48,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 25.32/11.02 [2019-03-28 12:43:48,256 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 25.32/11.02 [2019-03-28 12:43:48,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 25.32/11.02 [2019-03-28 12:43:48,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 25.32/11.02 [2019-03-28 12:43:48,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 25.32/11.02 [2019-03-28 12:43:48,326 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. 25.32/11.02 [2019-03-28 12:43:48,326 INFO L448 ceAbstractionStarter]: For program point L11-2(line 11) no Hoare annotation was computed. 25.32/11.02 [2019-03-28 12:43:48,327 INFO L448 ceAbstractionStarter]: For program point L11-3(line 11) no Hoare annotation was computed. 25.32/11.02 [2019-03-28 12:43:48,327 INFO L448 ceAbstractionStarter]: For program point L11-5(lines 11 12) no Hoare annotation was computed. 25.32/11.02 [2019-03-28 12:43:48,327 INFO L444 ceAbstractionStarter]: At program point L11-8(lines 11 12) the Hoare annotation is: (let ((.cse0 (select |#length| ULTIMATE.start_insertionSort_~a.base))) (and (= 0 ULTIMATE.start_insertionSort_~a.offset) (<= (* 4 ULTIMATE.start_insertionSort_~array_size) .cse0) (<= 0 ULTIMATE.start_insertionSort_~j~0) (<= (+ (* 4 ULTIMATE.start_insertionSort_~i~0) 4) .cse0) (= 1 (select |#valid| ULTIMATE.start_insertionSort_~a.base)) (<= (+ (* 4 ULTIMATE.start_insertionSort_~j~0) 4) .cse0) (<= 1 ULTIMATE.start_insertionSort_~i~0))) 25.32/11.02 [2019-03-28 12:43:48,327 INFO L448 ceAbstractionStarter]: For program point L11-9(lines 11 12) no Hoare annotation was computed. 25.32/11.02 [2019-03-28 12:43:48,328 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 25.32/11.02 [2019-03-28 12:43:48,328 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 22) no Hoare annotation was computed. 25.32/11.02 [2019-03-28 12:43:48,328 INFO L448 ceAbstractionStarter]: For program point L20-2(lines 20 22) no Hoare annotation was computed. 25.32/11.02 [2019-03-28 12:43:48,328 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 25.32/11.02 [2019-03-28 12:43:48,328 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 25.32/11.02 [2019-03-28 12:43:48,328 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 25.32/11.02 [2019-03-28 12:43:48,328 INFO L448 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. 25.32/11.02 [2019-03-28 12:43:48,328 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 25.32/11.02 [2019-03-28 12:43:48,329 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 25.32/11.02 [2019-03-28 12:43:48,329 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 25.32/11.02 [2019-03-28 12:43:48,329 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 25.32/11.02 [2019-03-28 12:43:48,329 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 25.32/11.02 [2019-03-28 12:43:48,329 INFO L444 ceAbstractionStarter]: At program point L8-2(lines 8 15) the Hoare annotation is: (and (= 0 ULTIMATE.start_insertionSort_~a.offset) (<= (* 4 ULTIMATE.start_insertionSort_~array_size) (select |#length| ULTIMATE.start_insertionSort_~a.base)) (= 1 (select |#valid| ULTIMATE.start_insertionSort_~a.base)) (<= 1 ULTIMATE.start_insertionSort_~i~0)) 25.32/11.02 [2019-03-28 12:43:48,329 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 25.32/11.02 [2019-03-28 12:43:48,329 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 25.32/11.02 [2019-03-28 12:43:48,330 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 25.32/11.02 [2019-03-28 12:43:48,330 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 25.32/11.02 [2019-03-28 12:43:48,330 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 25.32/11.02 [2019-03-28 12:43:48,338 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.32/11.02 [2019-03-28 12:43:48,344 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.32/11.02 [2019-03-28 12:43:48,347 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.32/11.02 [2019-03-28 12:43:48,347 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.32/11.02 [2019-03-28 12:43:48,347 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.32/11.02 [2019-03-28 12:43:48,348 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.32/11.02 [2019-03-28 12:43:48,348 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.32/11.02 [2019-03-28 12:43:48,349 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.32/11.02 [2019-03-28 12:43:48,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:43:48 BasicIcfg 25.32/11.02 [2019-03-28 12:43:48,350 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 25.32/11.02 [2019-03-28 12:43:48,351 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 25.32/11.02 [2019-03-28 12:43:48,351 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 25.32/11.02 [2019-03-28 12:43:48,355 INFO L276 PluginConnector]: BuchiAutomizer initialized 25.32/11.02 [2019-03-28 12:43:48,355 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.32/11.02 [2019-03-28 12:43:48,356 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:43:45" (1/5) ... 25.32/11.02 [2019-03-28 12:43:48,356 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69e96426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:43:48, skipping insertion in model container 25.32/11.02 [2019-03-28 12:43:48,356 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.32/11.02 [2019-03-28 12:43:48,357 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:46" (2/5) ... 25.32/11.02 [2019-03-28 12:43:48,357 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69e96426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:43:48, skipping insertion in model container 25.32/11.02 [2019-03-28 12:43:48,357 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.32/11.02 [2019-03-28 12:43:48,357 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:43:46" (3/5) ... 25.32/11.02 [2019-03-28 12:43:48,357 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69e96426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:43:48, skipping insertion in model container 25.32/11.02 [2019-03-28 12:43:48,358 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.32/11.02 [2019-03-28 12:43:48,358 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:43:46" (4/5) ... 25.32/11.02 [2019-03-28 12:43:48,358 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69e96426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:43:48, skipping insertion in model container 25.32/11.02 [2019-03-28 12:43:48,358 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.32/11.02 [2019-03-28 12:43:48,359 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:43:48" (5/5) ... 25.32/11.02 [2019-03-28 12:43:48,360 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 25.32/11.02 [2019-03-28 12:43:48,381 INFO L133 ementStrategyFactory]: Using default assertion order modulation 25.32/11.02 [2019-03-28 12:43:48,381 INFO L374 BuchiCegarLoop]: Interprodecural is true 25.32/11.02 [2019-03-28 12:43:48,381 INFO L375 BuchiCegarLoop]: Hoare is true 25.32/11.02 [2019-03-28 12:43:48,381 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 25.32/11.02 [2019-03-28 12:43:48,381 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 25.32/11.02 [2019-03-28 12:43:48,381 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 25.32/11.02 [2019-03-28 12:43:48,382 INFO L379 BuchiCegarLoop]: Difference is false 25.32/11.02 [2019-03-28 12:43:48,382 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 25.32/11.02 [2019-03-28 12:43:48,382 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 25.32/11.02 [2019-03-28 12:43:48,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. 25.32/11.02 [2019-03-28 12:43:48,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 25.32/11.02 [2019-03-28 12:43:48,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.32/11.02 [2019-03-28 12:43:48,391 INFO L119 BuchiIsEmpty]: Starting construction of run 25.32/11.02 [2019-03-28 12:43:48,395 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 25.32/11.02 [2019-03-28 12:43:48,395 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 25.32/11.02 [2019-03-28 12:43:48,395 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 25.32/11.02 [2019-03-28 12:43:48,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. 25.32/11.02 [2019-03-28 12:43:48,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 25.32/11.02 [2019-03-28 12:43:48,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.32/11.02 [2019-03-28 12:43:48,397 INFO L119 BuchiIsEmpty]: Starting construction of run 25.32/11.02 [2019-03-28 12:43:48,397 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 25.32/11.02 [2019-03-28 12:43:48,398 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 25.32/11.02 [2019-03-28 12:43:48,403 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue [143] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_3, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, #valid=|v_#valid_17|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~a~0.base, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 13#L20true [73] L20-->L20-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] 8#L20-2true [118] L20-2-->L8-2: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_insertionSort_~a.base_1 |v_ULTIMATE.start_insertionSort_#in~a.base_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.offset_1| v_ULTIMATE.start_main_~a~0.offset_2) (= v_ULTIMATE.start_insertionSort_~array_size_1 |v_ULTIMATE.start_insertionSort_#in~array_size_1|) (= v_ULTIMATE.start_insertionSort_~a.offset_1 |v_ULTIMATE.start_insertionSort_#in~a.offset_1|) (= |v_ULTIMATE.start_insertionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_insertionSort_~i~0_1 1) (= v_ULTIMATE.start_main_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.base_1| v_ULTIMATE.start_main_~a~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_1, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_1|, ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_1, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_1, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_2, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_insertionSort_#in~array_size=|v_ULTIMATE.start_insertionSort_#in~array_size_1|, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_1|, ULTIMATE.start_insertionSort_#in~a.base=|v_ULTIMATE.start_insertionSort_#in~a.base_1|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_insertionSort_#t~post2=|v_ULTIMATE.start_insertionSort_#t~post2_1|, #length=|v_#length_1|, ULTIMATE.start_insertionSort_#in~a.offset=|v_ULTIMATE.start_insertionSort_#in~a.offset_1|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_1, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_1|, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_1|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_1} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_insertionSort_~a.offset, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_insertionSort_~i~0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_insertionSort_#in~array_size, ULTIMATE.start_insertionSort_#t~pre0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_#in~a.base, ULTIMATE.start_main_~a~0.offset, #valid, ULTIMATE.start_insertionSort_#t~post2, #length, ULTIMATE.start_insertionSort_#in~a.offset, ULTIMATE.start_insertionSort_~a.base, ULTIMATE.start_insertionSort_#t~mem3, ULTIMATE.start_insertionSort_#t~mem5, ULTIMATE.start_insertionSort_~j~0] 5#L8-2true 25.32/11.02 [2019-03-28 12:43:48,404 INFO L796 eck$LassoCheckResult]: Loop: 5#L8-2true [97] L8-2-->L10: Formula: (< v_ULTIMATE.start_insertionSort_~i~0_5 v_ULTIMATE.start_insertionSort_~array_size_4) InVars {ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} AuxVars[] AssignedVars[] 14#L10true [145] L10-->L11-8: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~i~0_12))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13))) (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_insertionSort_~a.base_18) .cse0) v_ULTIMATE.start_insertionSort_~index~0_6) (<= (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13 4) (select |v_#length_13| v_ULTIMATE.start_insertionSort_~a.base_18)) (= v_ULTIMATE.start_insertionSort_~i~0_12 v_ULTIMATE.start_insertionSort_~j~0_15) (= 1 (select |v_#valid_21| v_ULTIMATE.start_insertionSort_~a.base_18)) (<= 0 .cse0)))) InVars {#valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_6, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_5|, #valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_~j~0] 24#L11-8true [123] L11-8-->L11-1: Formula: (and (not |v_ULTIMATE.start_insertionSort_#t~short4_2|) (>= 0 v_ULTIMATE.start_insertionSort_~j~0_4)) InVars {ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 15#L11-1true [100] L11-1-->L11-5: Formula: (not |v_ULTIMATE.start_insertionSort_#t~short4_5|) InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_5|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_5|} AuxVars[] AssignedVars[] 6#L11-5true [66] L11-5-->L11-9: Formula: (not |v_ULTIMATE.start_insertionSort_#t~short4_7|) InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_7|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_6|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_#t~mem3] 22#L11-9true [148] L11-9-->L8-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_16))) (let ((.cse0 (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse1))) (and (= (store |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19 (store (select |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19) .cse0 v_ULTIMATE.start_insertionSort_~index~0_7)) |v_#memory_int_9|) (<= (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse1 4) (select |v_#length_14| v_ULTIMATE.start_insertionSort_~a.base_19)) (= v_ULTIMATE.start_insertionSort_~i~0_15 (+ v_ULTIMATE.start_insertionSort_~i~0_16 1)) (<= 0 .cse0) (= 1 (select |v_#valid_26| v_ULTIMATE.start_insertionSort_~a.base_19))))) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_16, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_4|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_15, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~pre0, #memory_int, ULTIMATE.start_insertionSort_~i~0] 5#L8-2true 25.32/11.02 [2019-03-28 12:43:48,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:48,404 INFO L82 PathProgramCache]: Analyzing trace with hash 169595, now seen corresponding path program 1 times 25.32/11.02 [2019-03-28 12:43:48,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:48,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:48,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:48,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:48,434 INFO L82 PathProgramCache]: Analyzing trace with hash -492762836, now seen corresponding path program 1 times 25.32/11.02 [2019-03-28 12:43:48,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:48,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:48,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:48,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:48,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1972591654, now seen corresponding path program 1 times 25.32/11.02 [2019-03-28 12:43:48,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:48,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:48,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.02 [2019-03-28 12:43:48,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.32/11.02 [2019-03-28 12:43:48,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.32/11.02 [2019-03-28 12:43:48,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 25.32/11.02 [2019-03-28 12:43:48,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 25.32/11.02 [2019-03-28 12:43:48,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 25.32/11.02 [2019-03-28 12:43:48,560 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 4 states. 25.32/11.02 [2019-03-28 12:43:48,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.32/11.02 [2019-03-28 12:43:48,653 INFO L93 Difference]: Finished difference Result 43 states and 72 transitions. 25.32/11.02 [2019-03-28 12:43:48,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 25.32/11.02 [2019-03-28 12:43:48,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 72 transitions. 25.32/11.02 [2019-03-28 12:43:48,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 25.32/11.02 [2019-03-28 12:43:48,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 23 states and 32 transitions. 25.32/11.02 [2019-03-28 12:43:48,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 25.32/11.02 [2019-03-28 12:43:48,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 25.32/11.02 [2019-03-28 12:43:48,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. 25.32/11.02 [2019-03-28 12:43:48,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.32/11.02 [2019-03-28 12:43:48,662 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. 25.32/11.02 [2019-03-28 12:43:48,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. 25.32/11.02 [2019-03-28 12:43:48,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 14. 25.32/11.02 [2019-03-28 12:43:48,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 25.32/11.02 [2019-03-28 12:43:48,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. 25.32/11.02 [2019-03-28 12:43:48,666 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. 25.32/11.02 [2019-03-28 12:43:48,666 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. 25.32/11.02 [2019-03-28 12:43:48,666 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 25.32/11.02 [2019-03-28 12:43:48,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. 25.32/11.02 [2019-03-28 12:43:48,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 25.32/11.02 [2019-03-28 12:43:48,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.32/11.02 [2019-03-28 12:43:48,667 INFO L119 BuchiIsEmpty]: Starting construction of run 25.32/11.02 [2019-03-28 12:43:48,667 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 25.32/11.02 [2019-03-28 12:43:48,668 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 25.32/11.02 [2019-03-28 12:43:48,668 INFO L794 eck$LassoCheckResult]: Stem: 91#ULTIMATE.startENTRY [143] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_3, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, #valid=|v_#valid_17|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~a~0.base, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 88#L20 [73] L20-->L20-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] 85#L20-2 [118] L20-2-->L8-2: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_insertionSort_~a.base_1 |v_ULTIMATE.start_insertionSort_#in~a.base_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.offset_1| v_ULTIMATE.start_main_~a~0.offset_2) (= v_ULTIMATE.start_insertionSort_~array_size_1 |v_ULTIMATE.start_insertionSort_#in~array_size_1|) (= v_ULTIMATE.start_insertionSort_~a.offset_1 |v_ULTIMATE.start_insertionSort_#in~a.offset_1|) (= |v_ULTIMATE.start_insertionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_insertionSort_~i~0_1 1) (= v_ULTIMATE.start_main_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.base_1| v_ULTIMATE.start_main_~a~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_1, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_1|, ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_1, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_1, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_2, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_insertionSort_#in~array_size=|v_ULTIMATE.start_insertionSort_#in~array_size_1|, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_1|, ULTIMATE.start_insertionSort_#in~a.base=|v_ULTIMATE.start_insertionSort_#in~a.base_1|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_insertionSort_#t~post2=|v_ULTIMATE.start_insertionSort_#t~post2_1|, #length=|v_#length_1|, ULTIMATE.start_insertionSort_#in~a.offset=|v_ULTIMATE.start_insertionSort_#in~a.offset_1|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_1, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_1|, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_1|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_1} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_insertionSort_~a.offset, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_insertionSort_~i~0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_insertionSort_#in~array_size, ULTIMATE.start_insertionSort_#t~pre0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_#in~a.base, ULTIMATE.start_main_~a~0.offset, #valid, ULTIMATE.start_insertionSort_#t~post2, #length, ULTIMATE.start_insertionSort_#in~a.offset, ULTIMATE.start_insertionSort_~a.base, ULTIMATE.start_insertionSort_#t~mem3, ULTIMATE.start_insertionSort_#t~mem5, ULTIMATE.start_insertionSort_~j~0] 83#L8-2 25.32/11.02 [2019-03-28 12:43:48,669 INFO L796 eck$LassoCheckResult]: Loop: 83#L8-2 [97] L8-2-->L10: Formula: (< v_ULTIMATE.start_insertionSort_~i~0_5 v_ULTIMATE.start_insertionSort_~array_size_4) InVars {ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} AuxVars[] AssignedVars[] 84#L10 [145] L10-->L11-8: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~i~0_12))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13))) (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_insertionSort_~a.base_18) .cse0) v_ULTIMATE.start_insertionSort_~index~0_6) (<= (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13 4) (select |v_#length_13| v_ULTIMATE.start_insertionSort_~a.base_18)) (= v_ULTIMATE.start_insertionSort_~i~0_12 v_ULTIMATE.start_insertionSort_~j~0_15) (= 1 (select |v_#valid_21| v_ULTIMATE.start_insertionSort_~a.base_18)) (<= 0 .cse0)))) InVars {#valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_6, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_5|, #valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_~j~0] 90#L11-8 [124] L11-8-->L11-1: Formula: (and |v_ULTIMATE.start_insertionSort_#t~short4_2| (< 0 v_ULTIMATE.start_insertionSort_~j~0_4)) InVars {ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 89#L11-1 [100] L11-1-->L11-5: Formula: (not |v_ULTIMATE.start_insertionSort_#t~short4_5|) InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_5|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_5|} AuxVars[] AssignedVars[] 80#L11-5 [66] L11-5-->L11-9: Formula: (not |v_ULTIMATE.start_insertionSort_#t~short4_7|) InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_7|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_6|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_#t~mem3] 81#L11-9 [148] L11-9-->L8-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_16))) (let ((.cse0 (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse1))) (and (= (store |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19 (store (select |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19) .cse0 v_ULTIMATE.start_insertionSort_~index~0_7)) |v_#memory_int_9|) (<= (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse1 4) (select |v_#length_14| v_ULTIMATE.start_insertionSort_~a.base_19)) (= v_ULTIMATE.start_insertionSort_~i~0_15 (+ v_ULTIMATE.start_insertionSort_~i~0_16 1)) (<= 0 .cse0) (= 1 (select |v_#valid_26| v_ULTIMATE.start_insertionSort_~a.base_19))))) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_16, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_4|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_15, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~pre0, #memory_int, ULTIMATE.start_insertionSort_~i~0] 83#L8-2 25.32/11.02 [2019-03-28 12:43:48,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:48,669 INFO L82 PathProgramCache]: Analyzing trace with hash 169595, now seen corresponding path program 2 times 25.32/11.02 [2019-03-28 12:43:48,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:48,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:48,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:48,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:48,681 INFO L82 PathProgramCache]: Analyzing trace with hash -492733045, now seen corresponding path program 1 times 25.32/11.02 [2019-03-28 12:43:48,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:48,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:48,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.02 [2019-03-28 12:43:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.32/11.02 [2019-03-28 12:43:48,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.32/11.02 [2019-03-28 12:43:48,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.32/11.02 [2019-03-28 12:43:48,693 INFO L811 eck$LassoCheckResult]: loop already infeasible 25.32/11.02 [2019-03-28 12:43:48,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.32/11.02 [2019-03-28 12:43:48,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.32/11.02 [2019-03-28 12:43:48,693 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 7 Second operand 3 states. 25.32/11.02 [2019-03-28 12:43:48,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.32/11.02 [2019-03-28 12:43:48,713 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. 25.32/11.02 [2019-03-28 12:43:48,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.32/11.02 [2019-03-28 12:43:48,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. 25.32/11.02 [2019-03-28 12:43:48,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 25.32/11.02 [2019-03-28 12:43:48,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. 25.32/11.02 [2019-03-28 12:43:48,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 25.32/11.02 [2019-03-28 12:43:48,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 25.32/11.02 [2019-03-28 12:43:48,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. 25.32/11.02 [2019-03-28 12:43:48,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.32/11.02 [2019-03-28 12:43:48,715 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. 25.32/11.02 [2019-03-28 12:43:48,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. 25.32/11.02 [2019-03-28 12:43:48,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. 25.32/11.02 [2019-03-28 12:43:48,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 25.32/11.02 [2019-03-28 12:43:48,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. 25.32/11.02 [2019-03-28 12:43:48,717 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. 25.32/11.02 [2019-03-28 12:43:48,717 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. 25.32/11.02 [2019-03-28 12:43:48,717 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 25.32/11.02 [2019-03-28 12:43:48,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. 25.32/11.02 [2019-03-28 12:43:48,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 25.32/11.02 [2019-03-28 12:43:48,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.32/11.02 [2019-03-28 12:43:48,718 INFO L119 BuchiIsEmpty]: Starting construction of run 25.32/11.02 [2019-03-28 12:43:48,719 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 25.32/11.02 [2019-03-28 12:43:48,719 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 25.32/11.02 [2019-03-28 12:43:48,720 INFO L794 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY [143] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_3, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, #valid=|v_#valid_17|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~a~0.base, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 124#L20 [73] L20-->L20-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] 120#L20-2 [118] L20-2-->L8-2: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_insertionSort_~a.base_1 |v_ULTIMATE.start_insertionSort_#in~a.base_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.offset_1| v_ULTIMATE.start_main_~a~0.offset_2) (= v_ULTIMATE.start_insertionSort_~array_size_1 |v_ULTIMATE.start_insertionSort_#in~array_size_1|) (= v_ULTIMATE.start_insertionSort_~a.offset_1 |v_ULTIMATE.start_insertionSort_#in~a.offset_1|) (= |v_ULTIMATE.start_insertionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_insertionSort_~i~0_1 1) (= v_ULTIMATE.start_main_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.base_1| v_ULTIMATE.start_main_~a~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_1, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_1|, ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_1, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_1, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_2, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_insertionSort_#in~array_size=|v_ULTIMATE.start_insertionSort_#in~array_size_1|, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_1|, ULTIMATE.start_insertionSort_#in~a.base=|v_ULTIMATE.start_insertionSort_#in~a.base_1|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_insertionSort_#t~post2=|v_ULTIMATE.start_insertionSort_#t~post2_1|, #length=|v_#length_1|, ULTIMATE.start_insertionSort_#in~a.offset=|v_ULTIMATE.start_insertionSort_#in~a.offset_1|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_1, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_1|, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_1|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_1} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_insertionSort_~a.offset, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_insertionSort_~i~0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_insertionSort_#in~array_size, ULTIMATE.start_insertionSort_#t~pre0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_#in~a.base, ULTIMATE.start_main_~a~0.offset, #valid, ULTIMATE.start_insertionSort_#t~post2, #length, ULTIMATE.start_insertionSort_#in~a.offset, ULTIMATE.start_insertionSort_~a.base, ULTIMATE.start_insertionSort_#t~mem3, ULTIMATE.start_insertionSort_#t~mem5, ULTIMATE.start_insertionSort_~j~0] 116#L8-2 25.32/11.02 [2019-03-28 12:43:48,720 INFO L796 eck$LassoCheckResult]: Loop: 116#L8-2 [97] L8-2-->L10: Formula: (< v_ULTIMATE.start_insertionSort_~i~0_5 v_ULTIMATE.start_insertionSort_~array_size_4) InVars {ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} AuxVars[] AssignedVars[] 117#L10 [145] L10-->L11-8: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~i~0_12))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13))) (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_insertionSort_~a.base_18) .cse0) v_ULTIMATE.start_insertionSort_~index~0_6) (<= (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13 4) (select |v_#length_13| v_ULTIMATE.start_insertionSort_~a.base_18)) (= v_ULTIMATE.start_insertionSort_~i~0_12 v_ULTIMATE.start_insertionSort_~j~0_15) (= 1 (select |v_#valid_21| v_ULTIMATE.start_insertionSort_~a.base_18)) (<= 0 .cse0)))) InVars {#valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_6, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_5|, #valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_~j~0] 125#L11-8 [124] L11-8-->L11-1: Formula: (and |v_ULTIMATE.start_insertionSort_#t~short4_2| (< 0 v_ULTIMATE.start_insertionSort_~j~0_4)) InVars {ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 126#L11-1 [99] L11-1-->L11-2: Formula: |v_ULTIMATE.start_insertionSort_#t~short4_3| InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} AuxVars[] AssignedVars[] 123#L11-2 [70] L11-2-->L11-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_5))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5))) (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= .cse0 (select |v_#length_5| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= 4 .cse0) (= |v_ULTIMATE.start_insertionSort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_insertionSort_~a.base_6) (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5 (- 4))))))) InVars {#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_2|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~mem3] 121#L11-3 [134] L11-3-->L11-5: Formula: (and (not |v_ULTIMATE.start_insertionSort_#t~short4_4|) (>= v_ULTIMATE.start_insertionSort_~index~0_4 |v_ULTIMATE.start_insertionSort_#t~mem3_3|)) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_4|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 122#L11-5 [66] L11-5-->L11-9: Formula: (not |v_ULTIMATE.start_insertionSort_#t~short4_7|) InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_7|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_6|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_#t~mem3] 130#L11-9 [148] L11-9-->L8-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_16))) (let ((.cse0 (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse1))) (and (= (store |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19 (store (select |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19) .cse0 v_ULTIMATE.start_insertionSort_~index~0_7)) |v_#memory_int_9|) (<= (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse1 4) (select |v_#length_14| v_ULTIMATE.start_insertionSort_~a.base_19)) (= v_ULTIMATE.start_insertionSort_~i~0_15 (+ v_ULTIMATE.start_insertionSort_~i~0_16 1)) (<= 0 .cse0) (= 1 (select |v_#valid_26| v_ULTIMATE.start_insertionSort_~a.base_19))))) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_16, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_4|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_15, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~pre0, #memory_int, ULTIMATE.start_insertionSort_~i~0] 116#L8-2 25.32/11.02 [2019-03-28 12:43:48,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:48,721 INFO L82 PathProgramCache]: Analyzing trace with hash 169595, now seen corresponding path program 3 times 25.32/11.02 [2019-03-28 12:43:48,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:48,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:48,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:48,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:48,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1070869302, now seen corresponding path program 1 times 25.32/11.02 [2019-03-28 12:43:48,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:48,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:48,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:48,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:48,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1607815492, now seen corresponding path program 1 times 25.32/11.02 [2019-03-28 12:43:48,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:48,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:48,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.02 [2019-03-28 12:43:48,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.32/11.02 [2019-03-28 12:43:48,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.32/11.02 [2019-03-28 12:43:48,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 25.32/11.02 [2019-03-28 12:43:48,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 25.32/11.02 [2019-03-28 12:43:48,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 25.32/11.02 [2019-03-28 12:43:48,884 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 7 Second operand 4 states. 25.32/11.02 [2019-03-28 12:43:48,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.32/11.02 [2019-03-28 12:43:48,912 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. 25.32/11.02 [2019-03-28 12:43:48,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 25.32/11.02 [2019-03-28 12:43:48,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. 25.32/11.02 [2019-03-28 12:43:48,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 25.32/11.02 [2019-03-28 12:43:48,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 21 transitions. 25.32/11.02 [2019-03-28 12:43:48,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 25.32/11.02 [2019-03-28 12:43:48,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 25.32/11.02 [2019-03-28 12:43:48,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. 25.32/11.02 [2019-03-28 12:43:48,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.32/11.02 [2019-03-28 12:43:48,914 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. 25.32/11.02 [2019-03-28 12:43:48,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. 25.32/11.02 [2019-03-28 12:43:48,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. 25.32/11.02 [2019-03-28 12:43:48,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 25.32/11.02 [2019-03-28 12:43:48,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. 25.32/11.02 [2019-03-28 12:43:48,916 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. 25.32/11.02 [2019-03-28 12:43:48,916 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. 25.32/11.02 [2019-03-28 12:43:48,916 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 25.32/11.02 [2019-03-28 12:43:48,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. 25.32/11.02 [2019-03-28 12:43:48,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 25.32/11.02 [2019-03-28 12:43:48,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.32/11.02 [2019-03-28 12:43:48,917 INFO L119 BuchiIsEmpty]: Starting construction of run 25.32/11.02 [2019-03-28 12:43:48,917 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 25.32/11.02 [2019-03-28 12:43:48,917 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 25.32/11.02 [2019-03-28 12:43:48,918 INFO L794 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY [143] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_3, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, #valid=|v_#valid_17|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~a~0.base, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 169#L20 [102] L20-->L20-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[] 165#L20-2 [118] L20-2-->L8-2: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_insertionSort_~a.base_1 |v_ULTIMATE.start_insertionSort_#in~a.base_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.offset_1| v_ULTIMATE.start_main_~a~0.offset_2) (= v_ULTIMATE.start_insertionSort_~array_size_1 |v_ULTIMATE.start_insertionSort_#in~array_size_1|) (= v_ULTIMATE.start_insertionSort_~a.offset_1 |v_ULTIMATE.start_insertionSort_#in~a.offset_1|) (= |v_ULTIMATE.start_insertionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_insertionSort_~i~0_1 1) (= v_ULTIMATE.start_main_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.base_1| v_ULTIMATE.start_main_~a~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_1, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_1|, ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_1, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_1, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_2, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_insertionSort_#in~array_size=|v_ULTIMATE.start_insertionSort_#in~array_size_1|, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_1|, ULTIMATE.start_insertionSort_#in~a.base=|v_ULTIMATE.start_insertionSort_#in~a.base_1|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_insertionSort_#t~post2=|v_ULTIMATE.start_insertionSort_#t~post2_1|, #length=|v_#length_1|, ULTIMATE.start_insertionSort_#in~a.offset=|v_ULTIMATE.start_insertionSort_#in~a.offset_1|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_1, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_1|, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_1|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_1} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_insertionSort_~a.offset, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_insertionSort_~i~0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_insertionSort_#in~array_size, ULTIMATE.start_insertionSort_#t~pre0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_#in~a.base, ULTIMATE.start_main_~a~0.offset, #valid, ULTIMATE.start_insertionSort_#t~post2, #length, ULTIMATE.start_insertionSort_#in~a.offset, ULTIMATE.start_insertionSort_~a.base, ULTIMATE.start_insertionSort_#t~mem3, ULTIMATE.start_insertionSort_#t~mem5, ULTIMATE.start_insertionSort_~j~0] 161#L8-2 25.32/11.02 [2019-03-28 12:43:48,918 INFO L796 eck$LassoCheckResult]: Loop: 161#L8-2 [97] L8-2-->L10: Formula: (< v_ULTIMATE.start_insertionSort_~i~0_5 v_ULTIMATE.start_insertionSort_~array_size_4) InVars {ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} AuxVars[] AssignedVars[] 162#L10 [145] L10-->L11-8: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~i~0_12))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13))) (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_insertionSort_~a.base_18) .cse0) v_ULTIMATE.start_insertionSort_~index~0_6) (<= (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13 4) (select |v_#length_13| v_ULTIMATE.start_insertionSort_~a.base_18)) (= v_ULTIMATE.start_insertionSort_~i~0_12 v_ULTIMATE.start_insertionSort_~j~0_15) (= 1 (select |v_#valid_21| v_ULTIMATE.start_insertionSort_~a.base_18)) (<= 0 .cse0)))) InVars {#valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_6, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_5|, #valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_~j~0] 171#L11-8 [124] L11-8-->L11-1: Formula: (and |v_ULTIMATE.start_insertionSort_#t~short4_2| (< 0 v_ULTIMATE.start_insertionSort_~j~0_4)) InVars {ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 170#L11-1 [99] L11-1-->L11-2: Formula: |v_ULTIMATE.start_insertionSort_#t~short4_3| InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} AuxVars[] AssignedVars[] 168#L11-2 [70] L11-2-->L11-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_5))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5))) (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= .cse0 (select |v_#length_5| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= 4 .cse0) (= |v_ULTIMATE.start_insertionSort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_insertionSort_~a.base_6) (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5 (- 4))))))) InVars {#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_2|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~mem3] 166#L11-3 [134] L11-3-->L11-5: Formula: (and (not |v_ULTIMATE.start_insertionSort_#t~short4_4|) (>= v_ULTIMATE.start_insertionSort_~index~0_4 |v_ULTIMATE.start_insertionSort_#t~mem3_3|)) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_4|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 167#L11-5 [66] L11-5-->L11-9: Formula: (not |v_ULTIMATE.start_insertionSort_#t~short4_7|) InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_7|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_6|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_#t~mem3] 175#L11-9 [148] L11-9-->L8-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_16))) (let ((.cse0 (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse1))) (and (= (store |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19 (store (select |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19) .cse0 v_ULTIMATE.start_insertionSort_~index~0_7)) |v_#memory_int_9|) (<= (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse1 4) (select |v_#length_14| v_ULTIMATE.start_insertionSort_~a.base_19)) (= v_ULTIMATE.start_insertionSort_~i~0_15 (+ v_ULTIMATE.start_insertionSort_~i~0_16 1)) (<= 0 .cse0) (= 1 (select |v_#valid_26| v_ULTIMATE.start_insertionSort_~a.base_19))))) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_16, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_4|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_15, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~pre0, #memory_int, ULTIMATE.start_insertionSort_~i~0] 161#L8-2 25.32/11.02 [2019-03-28 12:43:48,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:48,919 INFO L82 PathProgramCache]: Analyzing trace with hash 170494, now seen corresponding path program 1 times 25.32/11.02 [2019-03-28 12:43:48,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:48,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:48,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:48,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:48,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1070869302, now seen corresponding path program 2 times 25.32/11.02 [2019-03-28 12:43:48,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:48,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:48,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:48,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:48,943 INFO L82 PathProgramCache]: Analyzing trace with hash 203891143, now seen corresponding path program 1 times 25.32/11.02 [2019-03-28 12:43:48,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:48,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:48,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:49,183 INFO L216 LassoAnalysis]: Preferences: 25.32/11.02 [2019-03-28 12:43:49,184 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.32/11.02 [2019-03-28 12:43:49,184 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.32/11.02 [2019-03-28 12:43:49,184 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.32/11.02 [2019-03-28 12:43:49,185 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.32/11.02 [2019-03-28 12:43:49,185 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.32/11.02 [2019-03-28 12:43:49,185 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.32/11.02 [2019-03-28 12:43:49,185 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.32/11.02 [2019-03-28 12:43:49,185 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 25.32/11.02 [2019-03-28 12:43:49,185 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.32/11.02 [2019-03-28 12:43:49,186 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.32/11.02 [2019-03-28 12:43:49,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.02 [2019-03-28 12:43:49,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.02 [2019-03-28 12:43:49,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.02 [2019-03-28 12:43:49,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.02 [2019-03-28 12:43:49,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.02 [2019-03-28 12:43:49,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.02 [2019-03-28 12:43:49,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.02 [2019-03-28 12:43:49,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.02 [2019-03-28 12:43:49,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.02 [2019-03-28 12:43:49,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.02 [2019-03-28 12:43:49,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.02 [2019-03-28 12:43:49,609 INFO L300 LassoAnalysis]: Preprocessing complete. 25.32/11.02 [2019-03-28 12:43:49,614 INFO L497 LassoAnalysis]: Using template 'affine'. 25.32/11.02 [2019-03-28 12:43:49,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.32/11.02 Termination analysis: LINEAR_WITH_GUESSES 25.32/11.02 Number of strict supporting invariants: 0 25.32/11.02 Number of non-strict supporting invariants: 1 25.32/11.02 Consider only non-deceasing supporting invariants: true 25.32/11.02 Simplify termination arguments: true 25.32/11.02 Simplify supporting invariants: trueOverapproximate stem: false 25.32/11.02 [2019-03-28 12:43:49,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.32/11.02 [2019-03-28 12:43:49,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.32/11.02 [2019-03-28 12:43:49,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.32/11.02 [2019-03-28 12:43:49,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.32/11.02 [2019-03-28 12:43:49,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.32/11.02 [2019-03-28 12:43:49,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.32/11.02 [2019-03-28 12:43:49,678 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.32/11.02 [2019-03-28 12:43:49,715 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. 25.32/11.02 [2019-03-28 12:43:49,715 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. 25.32/11.02 [2019-03-28 12:43:49,718 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.32/11.02 [2019-03-28 12:43:49,719 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 25.32/11.02 [2019-03-28 12:43:49,720 INFO L518 LassoAnalysis]: Proved termination. 25.32/11.02 [2019-03-28 12:43:49,721 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.32/11.02 Ranking function f(ULTIMATE.start_insertionSort_~a.offset, ULTIMATE.start_insertionSort_~i~0, v_rep(select #length ULTIMATE.start_insertionSort_~a.base)_1) = -1*ULTIMATE.start_insertionSort_~a.offset - 4*ULTIMATE.start_insertionSort_~i~0 + 1*v_rep(select #length ULTIMATE.start_insertionSort_~a.base)_1 25.32/11.02 Supporting invariants [] 25.32/11.02 [2019-03-28 12:43:49,739 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed 25.32/11.02 [2019-03-28 12:43:49,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.32/11.02 [2019-03-28 12:43:49,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.02 [2019-03-28 12:43:49,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core 25.32/11.02 [2019-03-28 12:43:49,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.32/11.02 [2019-03-28 12:43:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.02 [2019-03-28 12:43:49,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core 25.32/11.02 [2019-03-28 12:43:49,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.32/11.02 [2019-03-28 12:43:49,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.32/11.02 [2019-03-28 12:43:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.02 [2019-03-28 12:43:49,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core 25.32/11.02 [2019-03-28 12:43:49,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.32/11.02 [2019-03-28 12:43:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.02 [2019-03-28 12:43:49,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core 25.32/11.02 [2019-03-28 12:43:49,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.32/11.02 [2019-03-28 12:43:49,926 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 25.32/11.02 [2019-03-28 12:43:49,930 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 25.32/11.02 [2019-03-28 12:43:49,931 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 21 transitions. cyclomatic complexity: 6 Second operand 4 states. 25.32/11.02 [2019-03-28 12:43:50,002 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 21 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 42 states and 56 transitions. Complement of second has 6 states. 25.32/11.02 [2019-03-28 12:43:50,003 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 25.32/11.02 [2019-03-28 12:43:50,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 25.32/11.02 [2019-03-28 12:43:50,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. 25.32/11.02 [2019-03-28 12:43:50,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 3 letters. Loop has 8 letters. 25.32/11.02 [2019-03-28 12:43:50,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.32/11.02 [2019-03-28 12:43:50,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 11 letters. Loop has 8 letters. 25.32/11.02 [2019-03-28 12:43:50,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.32/11.02 [2019-03-28 12:43:50,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 3 letters. Loop has 16 letters. 25.32/11.02 [2019-03-28 12:43:50,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.32/11.02 [2019-03-28 12:43:50,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. 25.32/11.02 [2019-03-28 12:43:50,015 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 25.32/11.02 [2019-03-28 12:43:50,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 41 states and 55 transitions. 25.32/11.02 [2019-03-28 12:43:50,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 25.32/11.02 [2019-03-28 12:43:50,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 25.32/11.02 [2019-03-28 12:43:50,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 55 transitions. 25.32/11.02 [2019-03-28 12:43:50,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.32/11.02 [2019-03-28 12:43:50,016 INFO L706 BuchiCegarLoop]: Abstraction has 41 states and 55 transitions. 25.32/11.02 [2019-03-28 12:43:50,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 55 transitions. 25.32/11.02 [2019-03-28 12:43:50,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. 25.32/11.02 [2019-03-28 12:43:50,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. 25.32/11.02 [2019-03-28 12:43:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. 25.32/11.02 [2019-03-28 12:43:50,019 INFO L729 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. 25.32/11.02 [2019-03-28 12:43:50,019 INFO L609 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. 25.32/11.02 [2019-03-28 12:43:50,019 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 25.32/11.02 [2019-03-28 12:43:50,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 54 transitions. 25.32/11.02 [2019-03-28 12:43:50,020 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 25.32/11.02 [2019-03-28 12:43:50,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.32/11.02 [2019-03-28 12:43:50,020 INFO L119 BuchiIsEmpty]: Starting construction of run 25.32/11.02 [2019-03-28 12:43:50,021 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 25.32/11.02 [2019-03-28 12:43:50,021 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 25.32/11.02 [2019-03-28 12:43:50,021 INFO L794 eck$LassoCheckResult]: Stem: 356#ULTIMATE.startENTRY [143] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_3, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, #valid=|v_#valid_17|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~a~0.base, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 351#L20 [102] L20-->L20-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[] 344#L20-2 [117] L20-2-->L8-2: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_insertionSort_~a.base_1 |v_ULTIMATE.start_insertionSort_#in~a.base_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.offset_1| v_ULTIMATE.start_main_~a~0.offset_2) (= v_ULTIMATE.start_insertionSort_~array_size_1 |v_ULTIMATE.start_insertionSort_#in~array_size_1|) (= v_ULTIMATE.start_insertionSort_~a.offset_1 |v_ULTIMATE.start_insertionSort_#in~a.offset_1|) (= |v_ULTIMATE.start_insertionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_insertionSort_~i~0_1 1) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= v_ULTIMATE.start_main_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.base_1| v_ULTIMATE.start_main_~a~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_1, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_1|, ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_1, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_1, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_2, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_insertionSort_#in~array_size=|v_ULTIMATE.start_insertionSort_#in~array_size_1|, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_1|, ULTIMATE.start_insertionSort_#in~a.base=|v_ULTIMATE.start_insertionSort_#in~a.base_1|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_insertionSort_#t~post2=|v_ULTIMATE.start_insertionSort_#t~post2_1|, #length=|v_#length_1|, ULTIMATE.start_insertionSort_#in~a.offset=|v_ULTIMATE.start_insertionSort_#in~a.offset_1|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_1, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_1|, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_1|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_1} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_insertionSort_~a.offset, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_insertionSort_~i~0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_insertionSort_#in~array_size, ULTIMATE.start_insertionSort_#t~pre0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_#in~a.base, ULTIMATE.start_main_~a~0.offset, #valid, ULTIMATE.start_insertionSort_#t~post2, #length, ULTIMATE.start_insertionSort_#in~a.offset, ULTIMATE.start_insertionSort_~a.base, ULTIMATE.start_insertionSort_#t~mem3, ULTIMATE.start_insertionSort_#t~mem5, ULTIMATE.start_insertionSort_~j~0] 345#L8-2 25.32/11.02 [2019-03-28 12:43:50,022 INFO L796 eck$LassoCheckResult]: Loop: 345#L8-2 [97] L8-2-->L10: Formula: (< v_ULTIMATE.start_insertionSort_~i~0_5 v_ULTIMATE.start_insertionSort_~array_size_4) InVars {ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} AuxVars[] AssignedVars[] 374#L10 [145] L10-->L11-8: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~i~0_12))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13))) (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_insertionSort_~a.base_18) .cse0) v_ULTIMATE.start_insertionSort_~index~0_6) (<= (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13 4) (select |v_#length_13| v_ULTIMATE.start_insertionSort_~a.base_18)) (= v_ULTIMATE.start_insertionSort_~i~0_12 v_ULTIMATE.start_insertionSort_~j~0_15) (= 1 (select |v_#valid_21| v_ULTIMATE.start_insertionSort_~a.base_18)) (<= 0 .cse0)))) InVars {#valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_6, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_5|, #valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_~j~0] 373#L11-8 [124] L11-8-->L11-1: Formula: (and |v_ULTIMATE.start_insertionSort_#t~short4_2| (< 0 v_ULTIMATE.start_insertionSort_~j~0_4)) InVars {ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 371#L11-1 [99] L11-1-->L11-2: Formula: |v_ULTIMATE.start_insertionSort_#t~short4_3| InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} AuxVars[] AssignedVars[] 367#L11-2 [70] L11-2-->L11-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_5))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5))) (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= .cse0 (select |v_#length_5| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= 4 .cse0) (= |v_ULTIMATE.start_insertionSort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_insertionSort_~a.base_6) (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5 (- 4))))))) InVars {#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_2|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~mem3] 368#L11-3 [134] L11-3-->L11-5: Formula: (and (not |v_ULTIMATE.start_insertionSort_#t~short4_4|) (>= v_ULTIMATE.start_insertionSort_~index~0_4 |v_ULTIMATE.start_insertionSort_#t~mem3_3|)) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_4|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 364#L11-5 [66] L11-5-->L11-9: Formula: (not |v_ULTIMATE.start_insertionSort_#t~short4_7|) InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_7|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_6|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_#t~mem3] 361#L11-9 [148] L11-9-->L8-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_16))) (let ((.cse0 (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse1))) (and (= (store |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19 (store (select |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19) .cse0 v_ULTIMATE.start_insertionSort_~index~0_7)) |v_#memory_int_9|) (<= (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse1 4) (select |v_#length_14| v_ULTIMATE.start_insertionSort_~a.base_19)) (= v_ULTIMATE.start_insertionSort_~i~0_15 (+ v_ULTIMATE.start_insertionSort_~i~0_16 1)) (<= 0 .cse0) (= 1 (select |v_#valid_26| v_ULTIMATE.start_insertionSort_~a.base_19))))) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_16, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_4|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_15, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~pre0, #memory_int, ULTIMATE.start_insertionSort_~i~0] 345#L8-2 25.32/11.02 [2019-03-28 12:43:50,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:50,022 INFO L82 PathProgramCache]: Analyzing trace with hash 170493, now seen corresponding path program 1 times 25.32/11.02 [2019-03-28 12:43:50,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:50,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:50,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:50,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:50,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:50,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:50,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1070869302, now seen corresponding path program 3 times 25.32/11.02 [2019-03-28 12:43:50,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:50,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:50,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:50,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:50,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:50,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:50,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2011345606, now seen corresponding path program 1 times 25.32/11.02 [2019-03-28 12:43:50,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:50,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:50,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:50,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:50,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:50,261 INFO L216 LassoAnalysis]: Preferences: 25.32/11.02 [2019-03-28 12:43:50,261 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.32/11.02 [2019-03-28 12:43:50,261 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.32/11.02 [2019-03-28 12:43:50,261 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.32/11.02 [2019-03-28 12:43:50,261 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.32/11.02 [2019-03-28 12:43:50,261 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.32/11.02 [2019-03-28 12:43:50,261 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.32/11.02 [2019-03-28 12:43:50,262 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.32/11.02 [2019-03-28 12:43:50,262 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 25.32/11.02 [2019-03-28 12:43:50,262 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.32/11.02 [2019-03-28 12:43:50,262 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.32/11.02 [2019-03-28 12:43:50,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.02 [2019-03-28 12:43:50,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.02 [2019-03-28 12:43:50,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.02 [2019-03-28 12:43:50,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.02 [2019-03-28 12:43:50,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.02 [2019-03-28 12:43:50,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.02 [2019-03-28 12:43:50,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.02 [2019-03-28 12:43:50,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.02 [2019-03-28 12:43:50,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.02 [2019-03-28 12:43:50,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.02 [2019-03-28 12:43:50,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.02 [2019-03-28 12:43:50,723 INFO L300 LassoAnalysis]: Preprocessing complete. 25.32/11.02 [2019-03-28 12:43:50,723 INFO L497 LassoAnalysis]: Using template 'affine'. 25.32/11.02 [2019-03-28 12:43:50,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.32/11.02 Termination analysis: LINEAR_WITH_GUESSES 25.32/11.02 Number of strict supporting invariants: 0 25.32/11.02 Number of non-strict supporting invariants: 1 25.32/11.02 Consider only non-deceasing supporting invariants: true 25.32/11.02 Simplify termination arguments: true 25.32/11.02 Simplify supporting invariants: trueOverapproximate stem: false 25.32/11.02 [2019-03-28 12:43:50,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.32/11.02 [2019-03-28 12:43:50,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.32/11.02 [2019-03-28 12:43:50,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.32/11.02 [2019-03-28 12:43:50,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.32/11.02 [2019-03-28 12:43:50,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.32/11.02 [2019-03-28 12:43:50,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.32/11.02 [2019-03-28 12:43:50,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.32/11.02 [2019-03-28 12:43:50,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.32/11.02 Termination analysis: LINEAR_WITH_GUESSES 25.32/11.02 Number of strict supporting invariants: 0 25.32/11.02 Number of non-strict supporting invariants: 1 25.32/11.02 Consider only non-deceasing supporting invariants: true 25.32/11.02 Simplify termination arguments: true 25.32/11.02 Simplify supporting invariants: trueOverapproximate stem: false 25.32/11.02 [2019-03-28 12:43:50,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.32/11.02 [2019-03-28 12:43:50,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.32/11.02 [2019-03-28 12:43:50,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.32/11.02 [2019-03-28 12:43:50,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.32/11.02 [2019-03-28 12:43:50,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.32/11.02 [2019-03-28 12:43:50,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.32/11.02 [2019-03-28 12:43:50,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.32/11.02 [2019-03-28 12:43:50,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.32/11.02 Termination analysis: LINEAR_WITH_GUESSES 25.32/11.02 Number of strict supporting invariants: 0 25.32/11.02 Number of non-strict supporting invariants: 1 25.32/11.02 Consider only non-deceasing supporting invariants: true 25.32/11.02 Simplify termination arguments: true 25.32/11.02 Simplify supporting invariants: trueOverapproximate stem: false 25.32/11.02 [2019-03-28 12:43:50,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.32/11.02 [2019-03-28 12:43:50,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.32/11.02 [2019-03-28 12:43:50,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.32/11.02 [2019-03-28 12:43:50,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.32/11.02 [2019-03-28 12:43:50,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.32/11.02 [2019-03-28 12:43:50,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.32/11.02 [2019-03-28 12:43:50,755 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.32/11.02 [2019-03-28 12:43:50,768 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 25.32/11.02 [2019-03-28 12:43:50,769 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. 25.32/11.02 [2019-03-28 12:43:50,769 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.32/11.02 [2019-03-28 12:43:50,770 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 25.32/11.02 [2019-03-28 12:43:50,770 INFO L518 LassoAnalysis]: Proved termination. 25.32/11.02 [2019-03-28 12:43:50,770 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.32/11.02 Ranking function f(ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_~i~0) = 1*ULTIMATE.start_insertionSort_~array_size - 1*ULTIMATE.start_insertionSort_~i~0 25.32/11.02 Supporting invariants [] 25.32/11.02 [2019-03-28 12:43:50,780 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed 25.32/11.02 [2019-03-28 12:43:50,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.02 [2019-03-28 12:43:50,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core 25.32/11.02 [2019-03-28 12:43:50,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.32/11.02 [2019-03-28 12:43:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.02 [2019-03-28 12:43:50,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core 25.32/11.02 [2019-03-28 12:43:50,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.32/11.02 [2019-03-28 12:43:50,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.32/11.02 [2019-03-28 12:43:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.02 [2019-03-28 12:43:50,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core 25.32/11.02 [2019-03-28 12:43:50,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.32/11.02 [2019-03-28 12:43:50,891 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 25.32/11.02 [2019-03-28 12:43:50,892 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 25.32/11.02 [2019-03-28 12:43:50,892 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 3 states. 25.32/11.02 [2019-03-28 12:43:50,930 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 3 states. Result 53 states and 72 transitions. Complement of second has 4 states. 25.32/11.02 [2019-03-28 12:43:50,930 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 25.32/11.02 [2019-03-28 12:43:50,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 25.32/11.02 [2019-03-28 12:43:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. 25.32/11.02 [2019-03-28 12:43:50,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 3 letters. Loop has 8 letters. 25.32/11.02 [2019-03-28 12:43:50,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.32/11.02 [2019-03-28 12:43:50,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 11 letters. Loop has 8 letters. 25.32/11.02 [2019-03-28 12:43:50,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.32/11.02 [2019-03-28 12:43:50,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 3 letters. Loop has 16 letters. 25.32/11.02 [2019-03-28 12:43:50,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.32/11.02 [2019-03-28 12:43:50,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 72 transitions. 25.32/11.02 [2019-03-28 12:43:50,936 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 25.32/11.02 [2019-03-28 12:43:50,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 52 states and 71 transitions. 25.32/11.02 [2019-03-28 12:43:50,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 25.32/11.02 [2019-03-28 12:43:50,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 25.32/11.02 [2019-03-28 12:43:50,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 71 transitions. 25.32/11.02 [2019-03-28 12:43:50,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.32/11.02 [2019-03-28 12:43:50,938 INFO L706 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. 25.32/11.02 [2019-03-28 12:43:50,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 71 transitions. 25.32/11.02 [2019-03-28 12:43:50,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 27. 25.32/11.02 [2019-03-28 12:43:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 25.32/11.02 [2019-03-28 12:43:50,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. 25.32/11.02 [2019-03-28 12:43:50,940 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. 25.32/11.02 [2019-03-28 12:43:50,940 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. 25.32/11.02 [2019-03-28 12:43:50,940 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 25.32/11.02 [2019-03-28 12:43:50,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 37 transitions. 25.32/11.02 [2019-03-28 12:43:50,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 25.32/11.02 [2019-03-28 12:43:50,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.32/11.02 [2019-03-28 12:43:50,943 INFO L119 BuchiIsEmpty]: Starting construction of run 25.32/11.02 [2019-03-28 12:43:50,943 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 25.32/11.02 [2019-03-28 12:43:50,943 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 25.32/11.02 [2019-03-28 12:43:50,944 INFO L794 eck$LassoCheckResult]: Stem: 541#ULTIMATE.startENTRY [143] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_3, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, #valid=|v_#valid_17|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~a~0.base, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 536#L20 [102] L20-->L20-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[] 530#L20-2 [118] L20-2-->L8-2: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_insertionSort_~a.base_1 |v_ULTIMATE.start_insertionSort_#in~a.base_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.offset_1| v_ULTIMATE.start_main_~a~0.offset_2) (= v_ULTIMATE.start_insertionSort_~array_size_1 |v_ULTIMATE.start_insertionSort_#in~array_size_1|) (= v_ULTIMATE.start_insertionSort_~a.offset_1 |v_ULTIMATE.start_insertionSort_#in~a.offset_1|) (= |v_ULTIMATE.start_insertionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_insertionSort_~i~0_1 1) (= v_ULTIMATE.start_main_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.base_1| v_ULTIMATE.start_main_~a~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_1, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_1|, ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_1, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_1, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_2, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_insertionSort_#in~array_size=|v_ULTIMATE.start_insertionSort_#in~array_size_1|, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_1|, ULTIMATE.start_insertionSort_#in~a.base=|v_ULTIMATE.start_insertionSort_#in~a.base_1|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_insertionSort_#t~post2=|v_ULTIMATE.start_insertionSort_#t~post2_1|, #length=|v_#length_1|, ULTIMATE.start_insertionSort_#in~a.offset=|v_ULTIMATE.start_insertionSort_#in~a.offset_1|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_1, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_1|, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_1|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_1} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_insertionSort_~a.offset, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_insertionSort_~i~0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_insertionSort_#in~array_size, ULTIMATE.start_insertionSort_#t~pre0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_#in~a.base, ULTIMATE.start_main_~a~0.offset, #valid, ULTIMATE.start_insertionSort_#t~post2, #length, ULTIMATE.start_insertionSort_#in~a.offset, ULTIMATE.start_insertionSort_~a.base, ULTIMATE.start_insertionSort_#t~mem3, ULTIMATE.start_insertionSort_#t~mem5, ULTIMATE.start_insertionSort_~j~0] 522#L8-2 [97] L8-2-->L10: Formula: (< v_ULTIMATE.start_insertionSort_~i~0_5 v_ULTIMATE.start_insertionSort_~array_size_4) InVars {ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} AuxVars[] AssignedVars[] 524#L10 [145] L10-->L11-8: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~i~0_12))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13))) (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_insertionSort_~a.base_18) .cse0) v_ULTIMATE.start_insertionSort_~index~0_6) (<= (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13 4) (select |v_#length_13| v_ULTIMATE.start_insertionSort_~a.base_18)) (= v_ULTIMATE.start_insertionSort_~i~0_12 v_ULTIMATE.start_insertionSort_~j~0_15) (= 1 (select |v_#valid_21| v_ULTIMATE.start_insertionSort_~a.base_18)) (<= 0 .cse0)))) InVars {#valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_6, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_5|, #valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_~j~0] 539#L11-8 [124] L11-8-->L11-1: Formula: (and |v_ULTIMATE.start_insertionSort_#t~short4_2| (< 0 v_ULTIMATE.start_insertionSort_~j~0_4)) InVars {ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 537#L11-1 25.32/11.02 [2019-03-28 12:43:50,944 INFO L796 eck$LassoCheckResult]: Loop: 537#L11-1 [99] L11-1-->L11-2: Formula: |v_ULTIMATE.start_insertionSort_#t~short4_3| InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} AuxVars[] AssignedVars[] 534#L11-2 [70] L11-2-->L11-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_5))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5))) (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= .cse0 (select |v_#length_5| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= 4 .cse0) (= |v_ULTIMATE.start_insertionSort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_insertionSort_~a.base_6) (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5 (- 4))))))) InVars {#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_2|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~mem3] 531#L11-3 [133] L11-3-->L11-5: Formula: (and |v_ULTIMATE.start_insertionSort_#t~short4_4| (< v_ULTIMATE.start_insertionSort_~index~0_4 |v_ULTIMATE.start_insertionSort_#t~mem3_3|)) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_4|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 526#L11-5 [67] L11-5-->L12: Formula: |v_ULTIMATE.start_insertionSort_#t~short4_9| InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_9|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_8|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_#t~mem3] 527#L12 [83] L12-->L12-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_insertionSort_~j~0_7))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_insertionSort_~a.offset_7))) (and (= |v_ULTIMATE.start_insertionSort_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_insertionSort_~a.base_9) (+ .cse0 v_ULTIMATE.start_insertionSort_~a.offset_7 (- 4)))) (<= .cse1 (select |v_#length_7| v_ULTIMATE.start_insertionSort_~a.base_9)) (<= 4 .cse1) (= 1 (select |v_#valid_9| v_ULTIMATE.start_insertionSort_~a.base_9))))) InVars {#valid=|v_#valid_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_7, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_9, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_7} OutVars{#valid=|v_#valid_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_7, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_9, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~mem5] 542#L12-1 [150] L12-1-->L11-8: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_insertionSort_~j~0_19))) (let ((.cse1 (+ v_ULTIMATE.start_insertionSort_~a.offset_16 .cse0))) (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_insertionSort_~a.base_21)) (<= (+ v_ULTIMATE.start_insertionSort_~a.offset_16 .cse0 4) (select |v_#length_16| v_ULTIMATE.start_insertionSort_~a.base_21)) (= (store |v_#memory_int_14| v_ULTIMATE.start_insertionSort_~a.base_21 (store (select |v_#memory_int_14| v_ULTIMATE.start_insertionSort_~a.base_21) .cse1 |v_ULTIMATE.start_insertionSort_#t~mem5_8|)) |v_#memory_int_13|) (= v_ULTIMATE.start_insertionSort_~j~0_19 (+ v_ULTIMATE.start_insertionSort_~j~0_18 1)) (<= 0 .cse1)))) InVars {#valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_16, #length=|v_#length_16|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_21, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_19, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_8|} OutVars{#valid=|v_#valid_28|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_16, ULTIMATE.start_insertionSort_#t~post2=|v_ULTIMATE.start_insertionSort_#t~post2_4|, #length=|v_#length_16|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_21, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_18, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_7|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_insertionSort_#t~post2, ULTIMATE.start_insertionSort_~j~0, ULTIMATE.start_insertionSort_#t~mem5] 543#L11-8 [124] L11-8-->L11-1: Formula: (and |v_ULTIMATE.start_insertionSort_#t~short4_2| (< 0 v_ULTIMATE.start_insertionSort_~j~0_4)) InVars {ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 537#L11-1 25.32/11.02 [2019-03-28 12:43:50,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:50,944 INFO L82 PathProgramCache]: Analyzing trace with hash 784317294, now seen corresponding path program 1 times 25.32/11.02 [2019-03-28 12:43:50,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:50,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:50,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:50,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:50,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:50,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:50,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1540310935, now seen corresponding path program 1 times 25.32/11.02 [2019-03-28 12:43:50,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:50,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:50,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:50,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:50,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.02 [2019-03-28 12:43:50,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.02 [2019-03-28 12:43:50,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1630058614, now seen corresponding path program 1 times 25.32/11.02 [2019-03-28 12:43:50,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.02 [2019-03-28 12:43:50,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.02 [2019-03-28 12:43:50,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:50,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:50,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.02 [2019-03-28 12:43:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.02 [2019-03-28 12:43:50,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.32/11.02 [2019-03-28 12:43:50,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.32/11.02 [2019-03-28 12:43:50,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 25.32/11.02 [2019-03-28 12:43:51,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 25.32/11.02 [2019-03-28 12:43:51,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 25.32/11.02 [2019-03-28 12:43:51,092 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. cyclomatic complexity: 12 Second operand 5 states. 25.32/11.02 [2019-03-28 12:43:51,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.32/11.02 [2019-03-28 12:43:51,202 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. 25.32/11.02 [2019-03-28 12:43:51,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 25.32/11.02 [2019-03-28 12:43:51,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 104 transitions. 25.32/11.02 [2019-03-28 12:43:51,206 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 25.32/11.02 [2019-03-28 12:43:51,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 104 transitions. 25.32/11.02 [2019-03-28 12:43:51,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 25.32/11.02 [2019-03-28 12:43:51,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 25.32/11.02 [2019-03-28 12:43:51,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 104 transitions. 25.32/11.02 [2019-03-28 12:43:51,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.32/11.02 [2019-03-28 12:43:51,209 INFO L706 BuchiCegarLoop]: Abstraction has 81 states and 104 transitions. 25.32/11.02 [2019-03-28 12:43:51,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 104 transitions. 25.32/11.02 [2019-03-28 12:43:51,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 46. 25.32/11.02 [2019-03-28 12:43:51,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. 25.32/11.02 [2019-03-28 12:43:51,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. 25.32/11.03 [2019-03-28 12:43:51,213 INFO L729 BuchiCegarLoop]: Abstraction has 46 states and 59 transitions. 25.32/11.03 [2019-03-28 12:43:51,213 INFO L609 BuchiCegarLoop]: Abstraction has 46 states and 59 transitions. 25.32/11.03 [2019-03-28 12:43:51,213 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 25.32/11.03 [2019-03-28 12:43:51,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 59 transitions. 25.32/11.03 [2019-03-28 12:43:51,214 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 25.32/11.03 [2019-03-28 12:43:51,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.32/11.03 [2019-03-28 12:43:51,214 INFO L119 BuchiIsEmpty]: Starting construction of run 25.32/11.03 [2019-03-28 12:43:51,214 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 25.32/11.03 [2019-03-28 12:43:51,215 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 25.32/11.03 [2019-03-28 12:43:51,215 INFO L794 eck$LassoCheckResult]: Stem: 665#ULTIMATE.startENTRY [143] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_3, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, #valid=|v_#valid_17|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~a~0.base, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 660#L20 [102] L20-->L20-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[] 654#L20-2 [118] L20-2-->L8-2: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_insertionSort_~a.base_1 |v_ULTIMATE.start_insertionSort_#in~a.base_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.offset_1| v_ULTIMATE.start_main_~a~0.offset_2) (= v_ULTIMATE.start_insertionSort_~array_size_1 |v_ULTIMATE.start_insertionSort_#in~array_size_1|) (= v_ULTIMATE.start_insertionSort_~a.offset_1 |v_ULTIMATE.start_insertionSort_#in~a.offset_1|) (= |v_ULTIMATE.start_insertionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_insertionSort_~i~0_1 1) (= v_ULTIMATE.start_main_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.base_1| v_ULTIMATE.start_main_~a~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_1, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_1|, ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_1, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_1, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_2, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_insertionSort_#in~array_size=|v_ULTIMATE.start_insertionSort_#in~array_size_1|, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_1|, ULTIMATE.start_insertionSort_#in~a.base=|v_ULTIMATE.start_insertionSort_#in~a.base_1|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_insertionSort_#t~post2=|v_ULTIMATE.start_insertionSort_#t~post2_1|, #length=|v_#length_1|, ULTIMATE.start_insertionSort_#in~a.offset=|v_ULTIMATE.start_insertionSort_#in~a.offset_1|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_1, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_1|, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_1|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_1} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_insertionSort_~a.offset, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_insertionSort_~i~0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_insertionSort_#in~array_size, ULTIMATE.start_insertionSort_#t~pre0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_#in~a.base, ULTIMATE.start_main_~a~0.offset, #valid, ULTIMATE.start_insertionSort_#t~post2, #length, ULTIMATE.start_insertionSort_#in~a.offset, ULTIMATE.start_insertionSort_~a.base, ULTIMATE.start_insertionSort_#t~mem3, ULTIMATE.start_insertionSort_#t~mem5, ULTIMATE.start_insertionSort_~j~0] 644#L8-2 [97] L8-2-->L10: Formula: (< v_ULTIMATE.start_insertionSort_~i~0_5 v_ULTIMATE.start_insertionSort_~array_size_4) InVars {ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} AuxVars[] AssignedVars[] 646#L10 [145] L10-->L11-8: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~i~0_12))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13))) (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_insertionSort_~a.base_18) .cse0) v_ULTIMATE.start_insertionSort_~index~0_6) (<= (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13 4) (select |v_#length_13| v_ULTIMATE.start_insertionSort_~a.base_18)) (= v_ULTIMATE.start_insertionSort_~i~0_12 v_ULTIMATE.start_insertionSort_~j~0_15) (= 1 (select |v_#valid_21| v_ULTIMATE.start_insertionSort_~a.base_18)) (<= 0 .cse0)))) InVars {#valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_6, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_5|, #valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_~j~0] 661#L11-8 [124] L11-8-->L11-1: Formula: (and |v_ULTIMATE.start_insertionSort_#t~short4_2| (< 0 v_ULTIMATE.start_insertionSort_~j~0_4)) InVars {ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 663#L11-1 [99] L11-1-->L11-2: Formula: |v_ULTIMATE.start_insertionSort_#t~short4_3| InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} AuxVars[] AssignedVars[] 658#L11-2 25.32/11.03 [2019-03-28 12:43:51,216 INFO L796 eck$LassoCheckResult]: Loop: 658#L11-2 [70] L11-2-->L11-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_5))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5))) (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= .cse0 (select |v_#length_5| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= 4 .cse0) (= |v_ULTIMATE.start_insertionSort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_insertionSort_~a.base_6) (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5 (- 4))))))) InVars {#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_2|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~mem3] 655#L11-3 [133] L11-3-->L11-5: Formula: (and |v_ULTIMATE.start_insertionSort_#t~short4_4| (< v_ULTIMATE.start_insertionSort_~index~0_4 |v_ULTIMATE.start_insertionSort_#t~mem3_3|)) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_4|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 650#L11-5 [67] L11-5-->L12: Formula: |v_ULTIMATE.start_insertionSort_#t~short4_9| InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_9|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_8|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_#t~mem3] 651#L12 [83] L12-->L12-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_insertionSort_~j~0_7))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_insertionSort_~a.offset_7))) (and (= |v_ULTIMATE.start_insertionSort_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_insertionSort_~a.base_9) (+ .cse0 v_ULTIMATE.start_insertionSort_~a.offset_7 (- 4)))) (<= .cse1 (select |v_#length_7| v_ULTIMATE.start_insertionSort_~a.base_9)) (<= 4 .cse1) (= 1 (select |v_#valid_9| v_ULTIMATE.start_insertionSort_~a.base_9))))) InVars {#valid=|v_#valid_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_7, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_9, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_7} OutVars{#valid=|v_#valid_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_7, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_9, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~mem5] 666#L12-1 [150] L12-1-->L11-8: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_insertionSort_~j~0_19))) (let ((.cse1 (+ v_ULTIMATE.start_insertionSort_~a.offset_16 .cse0))) (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_insertionSort_~a.base_21)) (<= (+ v_ULTIMATE.start_insertionSort_~a.offset_16 .cse0 4) (select |v_#length_16| v_ULTIMATE.start_insertionSort_~a.base_21)) (= (store |v_#memory_int_14| v_ULTIMATE.start_insertionSort_~a.base_21 (store (select |v_#memory_int_14| v_ULTIMATE.start_insertionSort_~a.base_21) .cse1 |v_ULTIMATE.start_insertionSort_#t~mem5_8|)) |v_#memory_int_13|) (= v_ULTIMATE.start_insertionSort_~j~0_19 (+ v_ULTIMATE.start_insertionSort_~j~0_18 1)) (<= 0 .cse1)))) InVars {#valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_16, #length=|v_#length_16|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_21, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_19, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_8|} OutVars{#valid=|v_#valid_28|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_16, ULTIMATE.start_insertionSort_#t~post2=|v_ULTIMATE.start_insertionSort_#t~post2_4|, #length=|v_#length_16|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_21, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_18, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_7|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_insertionSort_#t~post2, ULTIMATE.start_insertionSort_~j~0, ULTIMATE.start_insertionSort_#t~mem5] 667#L11-8 [123] L11-8-->L11-1: Formula: (and (not |v_ULTIMATE.start_insertionSort_#t~short4_2|) (>= 0 v_ULTIMATE.start_insertionSort_~j~0_4)) InVars {ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 683#L11-1 [99] L11-1-->L11-2: Formula: |v_ULTIMATE.start_insertionSort_#t~short4_3| InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} AuxVars[] AssignedVars[] 658#L11-2 25.32/11.03 [2019-03-28 12:43:51,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.03 [2019-03-28 12:43:51,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1455967563, now seen corresponding path program 1 times 25.32/11.03 [2019-03-28 12:43:51,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.03 [2019-03-28 12:43:51,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.03 [2019-03-28 12:43:51,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.03 [2019-03-28 12:43:51,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.03 [2019-03-28 12:43:51,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.03 [2019-03-28 12:43:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.03 [2019-03-28 12:43:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.03 [2019-03-28 12:43:51,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.03 [2019-03-28 12:43:51,229 INFO L82 PathProgramCache]: Analyzing trace with hash -979235026, now seen corresponding path program 1 times 25.32/11.03 [2019-03-28 12:43:51,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.03 [2019-03-28 12:43:51,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.03 [2019-03-28 12:43:51,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.03 [2019-03-28 12:43:51,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.03 [2019-03-28 12:43:51,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.03 [2019-03-28 12:43:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.03 [2019-03-28 12:43:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.32/11.03 [2019-03-28 12:43:51,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.32/11.03 [2019-03-28 12:43:51,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.32/11.03 [2019-03-28 12:43:51,243 INFO L811 eck$LassoCheckResult]: loop already infeasible 25.32/11.03 [2019-03-28 12:43:51,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.32/11.03 [2019-03-28 12:43:51,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.32/11.03 [2019-03-28 12:43:51,244 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. cyclomatic complexity: 16 Second operand 3 states. 25.32/11.03 [2019-03-28 12:43:51,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.32/11.03 [2019-03-28 12:43:51,263 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. 25.32/11.03 [2019-03-28 12:43:51,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.32/11.03 [2019-03-28 12:43:51,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 55 transitions. 25.32/11.03 [2019-03-28 12:43:51,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 25.32/11.03 [2019-03-28 12:43:51,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 36 states and 41 transitions. 25.32/11.03 [2019-03-28 12:43:51,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 25.32/11.03 [2019-03-28 12:43:51,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 25.32/11.03 [2019-03-28 12:43:51,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 41 transitions. 25.32/11.03 [2019-03-28 12:43:51,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.32/11.03 [2019-03-28 12:43:51,269 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. 25.32/11.03 [2019-03-28 12:43:51,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 41 transitions. 25.32/11.03 [2019-03-28 12:43:51,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. 25.32/11.03 [2019-03-28 12:43:51,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 25.32/11.03 [2019-03-28 12:43:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. 25.32/11.03 [2019-03-28 12:43:51,271 INFO L729 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. 25.32/11.03 [2019-03-28 12:43:51,272 INFO L609 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. 25.32/11.03 [2019-03-28 12:43:51,272 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 25.32/11.03 [2019-03-28 12:43:51,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 39 transitions. 25.32/11.03 [2019-03-28 12:43:51,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 25.32/11.03 [2019-03-28 12:43:51,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.32/11.03 [2019-03-28 12:43:51,273 INFO L119 BuchiIsEmpty]: Starting construction of run 25.32/11.03 [2019-03-28 12:43:51,273 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 25.32/11.03 [2019-03-28 12:43:51,273 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 25.32/11.03 [2019-03-28 12:43:51,274 INFO L794 eck$LassoCheckResult]: Stem: 764#ULTIMATE.startENTRY [143] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_3, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, #valid=|v_#valid_17|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~a~0.base, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 759#L20 [102] L20-->L20-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[] 753#L20-2 [118] L20-2-->L8-2: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_insertionSort_~a.base_1 |v_ULTIMATE.start_insertionSort_#in~a.base_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.offset_1| v_ULTIMATE.start_main_~a~0.offset_2) (= v_ULTIMATE.start_insertionSort_~array_size_1 |v_ULTIMATE.start_insertionSort_#in~array_size_1|) (= v_ULTIMATE.start_insertionSort_~a.offset_1 |v_ULTIMATE.start_insertionSort_#in~a.offset_1|) (= |v_ULTIMATE.start_insertionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_insertionSort_~i~0_1 1) (= v_ULTIMATE.start_main_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.base_1| v_ULTIMATE.start_main_~a~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_1, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_1|, ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_1, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_1, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_2, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_insertionSort_#in~array_size=|v_ULTIMATE.start_insertionSort_#in~array_size_1|, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_1|, ULTIMATE.start_insertionSort_#in~a.base=|v_ULTIMATE.start_insertionSort_#in~a.base_1|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_insertionSort_#t~post2=|v_ULTIMATE.start_insertionSort_#t~post2_1|, #length=|v_#length_1|, ULTIMATE.start_insertionSort_#in~a.offset=|v_ULTIMATE.start_insertionSort_#in~a.offset_1|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_1, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_1|, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_1|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_1} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_insertionSort_~a.offset, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_insertionSort_~i~0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_insertionSort_#in~array_size, ULTIMATE.start_insertionSort_#t~pre0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_#in~a.base, ULTIMATE.start_main_~a~0.offset, #valid, ULTIMATE.start_insertionSort_#t~post2, #length, ULTIMATE.start_insertionSort_#in~a.offset, ULTIMATE.start_insertionSort_~a.base, ULTIMATE.start_insertionSort_#t~mem3, ULTIMATE.start_insertionSort_#t~mem5, ULTIMATE.start_insertionSort_~j~0] 748#L8-2 [97] L8-2-->L10: Formula: (< v_ULTIMATE.start_insertionSort_~i~0_5 v_ULTIMATE.start_insertionSort_~array_size_4) InVars {ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} AuxVars[] AssignedVars[] 749#L10 [145] L10-->L11-8: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~i~0_12))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13))) (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_insertionSort_~a.base_18) .cse0) v_ULTIMATE.start_insertionSort_~index~0_6) (<= (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13 4) (select |v_#length_13| v_ULTIMATE.start_insertionSort_~a.base_18)) (= v_ULTIMATE.start_insertionSort_~i~0_12 v_ULTIMATE.start_insertionSort_~j~0_15) (= 1 (select |v_#valid_21| v_ULTIMATE.start_insertionSort_~a.base_18)) (<= 0 .cse0)))) InVars {#valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_6, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_5|, #valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_~j~0] 777#L11-8 [124] L11-8-->L11-1: Formula: (and |v_ULTIMATE.start_insertionSort_#t~short4_2| (< 0 v_ULTIMATE.start_insertionSort_~j~0_4)) InVars {ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 776#L11-1 [99] L11-1-->L11-2: Formula: |v_ULTIMATE.start_insertionSort_#t~short4_3| InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} AuxVars[] AssignedVars[] 775#L11-2 [70] L11-2-->L11-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_5))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5))) (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= .cse0 (select |v_#length_5| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= 4 .cse0) (= |v_ULTIMATE.start_insertionSort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_insertionSort_~a.base_6) (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5 (- 4))))))) InVars {#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_2|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~mem3] 774#L11-3 [134] L11-3-->L11-5: Formula: (and (not |v_ULTIMATE.start_insertionSort_#t~short4_4|) (>= v_ULTIMATE.start_insertionSort_~index~0_4 |v_ULTIMATE.start_insertionSort_#t~mem3_3|)) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_4|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 756#L11-5 [66] L11-5-->L11-9: Formula: (not |v_ULTIMATE.start_insertionSort_#t~short4_7|) InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_7|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_6|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_#t~mem3] 768#L11-9 [148] L11-9-->L8-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_16))) (let ((.cse0 (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse1))) (and (= (store |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19 (store (select |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19) .cse0 v_ULTIMATE.start_insertionSort_~index~0_7)) |v_#memory_int_9|) (<= (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse1 4) (select |v_#length_14| v_ULTIMATE.start_insertionSort_~a.base_19)) (= v_ULTIMATE.start_insertionSort_~i~0_15 (+ v_ULTIMATE.start_insertionSort_~i~0_16 1)) (<= 0 .cse0) (= 1 (select |v_#valid_26| v_ULTIMATE.start_insertionSort_~a.base_19))))) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_16, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_4|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_15, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~pre0, #memory_int, ULTIMATE.start_insertionSort_~i~0] 750#L8-2 [97] L8-2-->L10: Formula: (< v_ULTIMATE.start_insertionSort_~i~0_5 v_ULTIMATE.start_insertionSort_~array_size_4) InVars {ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} AuxVars[] AssignedVars[] 752#L10 [145] L10-->L11-8: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~i~0_12))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13))) (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_insertionSort_~a.base_18) .cse0) v_ULTIMATE.start_insertionSort_~index~0_6) (<= (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13 4) (select |v_#length_13| v_ULTIMATE.start_insertionSort_~a.base_18)) (= v_ULTIMATE.start_insertionSort_~i~0_12 v_ULTIMATE.start_insertionSort_~j~0_15) (= 1 (select |v_#valid_21| v_ULTIMATE.start_insertionSort_~a.base_18)) (<= 0 .cse0)))) InVars {#valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_6, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_5|, #valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_~j~0] 762#L11-8 25.32/11.03 [2019-03-28 12:43:51,275 INFO L796 eck$LassoCheckResult]: Loop: 762#L11-8 [124] L11-8-->L11-1: Formula: (and |v_ULTIMATE.start_insertionSort_#t~short4_2| (< 0 v_ULTIMATE.start_insertionSort_~j~0_4)) InVars {ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 760#L11-1 [99] L11-1-->L11-2: Formula: |v_ULTIMATE.start_insertionSort_#t~short4_3| InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} AuxVars[] AssignedVars[] 757#L11-2 [70] L11-2-->L11-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_5))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5))) (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= .cse0 (select |v_#length_5| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= 4 .cse0) (= |v_ULTIMATE.start_insertionSort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_insertionSort_~a.base_6) (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5 (- 4))))))) InVars {#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_2|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~mem3] 754#L11-3 [133] L11-3-->L11-5: Formula: (and |v_ULTIMATE.start_insertionSort_#t~short4_4| (< v_ULTIMATE.start_insertionSort_~index~0_4 |v_ULTIMATE.start_insertionSort_#t~mem3_3|)) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_4|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 744#L11-5 [67] L11-5-->L12: Formula: |v_ULTIMATE.start_insertionSort_#t~short4_9| InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_9|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_8|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_#t~mem3] 745#L12 [83] L12-->L12-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_insertionSort_~j~0_7))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_insertionSort_~a.offset_7))) (and (= |v_ULTIMATE.start_insertionSort_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_insertionSort_~a.base_9) (+ .cse0 v_ULTIMATE.start_insertionSort_~a.offset_7 (- 4)))) (<= .cse1 (select |v_#length_7| v_ULTIMATE.start_insertionSort_~a.base_9)) (<= 4 .cse1) (= 1 (select |v_#valid_9| v_ULTIMATE.start_insertionSort_~a.base_9))))) InVars {#valid=|v_#valid_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_7, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_9, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_7} OutVars{#valid=|v_#valid_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_7, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_9, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~mem5] 765#L12-1 [150] L12-1-->L11-8: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_insertionSort_~j~0_19))) (let ((.cse1 (+ v_ULTIMATE.start_insertionSort_~a.offset_16 .cse0))) (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_insertionSort_~a.base_21)) (<= (+ v_ULTIMATE.start_insertionSort_~a.offset_16 .cse0 4) (select |v_#length_16| v_ULTIMATE.start_insertionSort_~a.base_21)) (= (store |v_#memory_int_14| v_ULTIMATE.start_insertionSort_~a.base_21 (store (select |v_#memory_int_14| v_ULTIMATE.start_insertionSort_~a.base_21) .cse1 |v_ULTIMATE.start_insertionSort_#t~mem5_8|)) |v_#memory_int_13|) (= v_ULTIMATE.start_insertionSort_~j~0_19 (+ v_ULTIMATE.start_insertionSort_~j~0_18 1)) (<= 0 .cse1)))) InVars {#valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_16, #length=|v_#length_16|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_21, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_19, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_8|} OutVars{#valid=|v_#valid_28|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_16, ULTIMATE.start_insertionSort_#t~post2=|v_ULTIMATE.start_insertionSort_#t~post2_4|, #length=|v_#length_16|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_21, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_18, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_7|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_insertionSort_#t~post2, ULTIMATE.start_insertionSort_~j~0, ULTIMATE.start_insertionSort_#t~mem5] 762#L11-8 25.32/11.03 [2019-03-28 12:43:51,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.03 [2019-03-28 12:43:51,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1629104041, now seen corresponding path program 2 times 25.32/11.03 [2019-03-28 12:43:51,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.03 [2019-03-28 12:43:51,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.03 [2019-03-28 12:43:51,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.03 [2019-03-28 12:43:51,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.32/11.03 [2019-03-28 12:43:51,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.03 [2019-03-28 12:43:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.03 [2019-03-28 12:43:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.03 [2019-03-28 12:43:51,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.03 [2019-03-28 12:43:51,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1267888481, now seen corresponding path program 2 times 25.32/11.03 [2019-03-28 12:43:51,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.03 [2019-03-28 12:43:51,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.03 [2019-03-28 12:43:51,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.03 [2019-03-28 12:43:51,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.32/11.03 [2019-03-28 12:43:51,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.03 [2019-03-28 12:43:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.03 [2019-03-28 12:43:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.03 [2019-03-28 12:43:51,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.03 [2019-03-28 12:43:51,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1567213961, now seen corresponding path program 1 times 25.32/11.03 [2019-03-28 12:43:51,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.32/11.03 [2019-03-28 12:43:51,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.32/11.03 [2019-03-28 12:43:51,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.03 [2019-03-28 12:43:51,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.32/11.03 [2019-03-28 12:43:51,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.32/11.03 [2019-03-28 12:43:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.03 [2019-03-28 12:43:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.32/11.03 [2019-03-28 12:43:51,651 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 83 25.32/11.03 [2019-03-28 12:43:51,723 INFO L216 LassoAnalysis]: Preferences: 25.32/11.03 [2019-03-28 12:43:51,723 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.32/11.03 [2019-03-28 12:43:51,723 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.32/11.03 [2019-03-28 12:43:51,723 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.32/11.03 [2019-03-28 12:43:51,723 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.32/11.03 [2019-03-28 12:43:51,724 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.32/11.03 [2019-03-28 12:43:51,724 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.32/11.03 [2019-03-28 12:43:51,724 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.32/11.03 [2019-03-28 12:43:51,724 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Lasso 25.32/11.03 [2019-03-28 12:43:51,724 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.32/11.03 [2019-03-28 12:43:51,724 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.32/11.03 [2019-03-28 12:43:51,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.03 [2019-03-28 12:43:51,902 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 25.32/11.03 [2019-03-28 12:43:51,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.03 [2019-03-28 12:43:51,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.03 [2019-03-28 12:43:51,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.03 [2019-03-28 12:43:51,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.03 [2019-03-28 12:43:51,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.03 [2019-03-28 12:43:51,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.03 [2019-03-28 12:43:51,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.03 [2019-03-28 12:43:51,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.03 [2019-03-28 12:43:51,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.03 [2019-03-28 12:43:51,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.32/11.03 [2019-03-28 12:43:52,212 INFO L300 LassoAnalysis]: Preprocessing complete. 25.32/11.03 [2019-03-28 12:43:52,213 INFO L497 LassoAnalysis]: Using template 'affine'. 25.32/11.03 [2019-03-28 12:43:52,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.32/11.03 Termination analysis: LINEAR_WITH_GUESSES 25.32/11.03 Number of strict supporting invariants: 0 25.32/11.03 Number of non-strict supporting invariants: 1 25.32/11.03 Consider only non-deceasing supporting invariants: true 25.32/11.03 Simplify termination arguments: true 25.32/11.03 Simplify supporting invariants: trueOverapproximate stem: false 25.32/11.03 [2019-03-28 12:43:52,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.32/11.03 [2019-03-28 12:43:52,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.32/11.03 [2019-03-28 12:43:52,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.32/11.03 [2019-03-28 12:43:52,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.32/11.03 [2019-03-28 12:43:52,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.32/11.03 [2019-03-28 12:43:52,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.32/11.03 [2019-03-28 12:43:52,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.32/11.03 [2019-03-28 12:43:52,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.32/11.03 Termination analysis: LINEAR_WITH_GUESSES 25.32/11.03 Number of strict supporting invariants: 0 25.32/11.03 Number of non-strict supporting invariants: 1 25.32/11.03 Consider only non-deceasing supporting invariants: true 25.32/11.03 Simplify termination arguments: true 25.32/11.03 Simplify supporting invariants: trueOverapproximate stem: false 25.32/11.03 [2019-03-28 12:43:52,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.32/11.03 [2019-03-28 12:43:52,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.32/11.03 [2019-03-28 12:43:52,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.32/11.03 [2019-03-28 12:43:52,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.32/11.03 [2019-03-28 12:43:52,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.32/11.03 [2019-03-28 12:43:52,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.32/11.03 [2019-03-28 12:43:52,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.32/11.03 [2019-03-28 12:43:52,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.32/11.03 [2019-03-28 12:43:52,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.32/11.03 Termination analysis: LINEAR_WITH_GUESSES 25.32/11.03 Number of strict supporting invariants: 0 25.32/11.03 Number of non-strict supporting invariants: 1 25.32/11.03 Consider only non-deceasing supporting invariants: true 25.32/11.03 Simplify termination arguments: true 25.32/11.03 Simplify supporting invariants: trueOverapproximate stem: false 25.32/11.03 [2019-03-28 12:43:52,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.32/11.03 [2019-03-28 12:43:52,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.32/11.03 [2019-03-28 12:43:52,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.32/11.03 [2019-03-28 12:43:52,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.32/11.03 [2019-03-28 12:43:52,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.32/11.03 [2019-03-28 12:43:52,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.32/11.03 [2019-03-28 12:43:52,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.32/11.03 [2019-03-28 12:43:52,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.32/11.03 Termination analysis: LINEAR_WITH_GUESSES 25.32/11.03 Number of strict supporting invariants: 0 25.32/11.03 Number of non-strict supporting invariants: 1 25.32/11.03 Consider only non-deceasing supporting invariants: true 25.32/11.03 Simplify termination arguments: true 25.32/11.03 Simplify supporting invariants: trueOverapproximate stem: false 25.32/11.03 [2019-03-28 12:43:52,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.32/11.03 [2019-03-28 12:43:52,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.32/11.03 [2019-03-28 12:43:52,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.32/11.03 [2019-03-28 12:43:52,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.32/11.03 [2019-03-28 12:43:52,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.32/11.03 [2019-03-28 12:43:52,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.32/11.03 [2019-03-28 12:43:52,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.32/11.03 [2019-03-28 12:43:52,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.32/11.03 Termination analysis: LINEAR_WITH_GUESSES 25.32/11.03 Number of strict supporting invariants: 0 25.32/11.03 Number of non-strict supporting invariants: 1 25.32/11.03 Consider only non-deceasing supporting invariants: true 25.32/11.03 Simplify termination arguments: true 25.32/11.03 Simplify supporting invariants: trueOverapproximate stem: false 25.32/11.03 [2019-03-28 12:43:52,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.32/11.03 [2019-03-28 12:43:52,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.32/11.03 [2019-03-28 12:43:52,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.32/11.03 [2019-03-28 12:43:52,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.32/11.03 [2019-03-28 12:43:52,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.32/11.03 [2019-03-28 12:43:52,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.32/11.03 [2019-03-28 12:43:52,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.32/11.03 [2019-03-28 12:43:52,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.32/11.03 Termination analysis: LINEAR_WITH_GUESSES 25.32/11.03 Number of strict supporting invariants: 0 25.32/11.03 Number of non-strict supporting invariants: 1 25.32/11.03 Consider only non-deceasing supporting invariants: true 25.32/11.03 Simplify termination arguments: true 25.32/11.03 Simplify supporting invariants: trueOverapproximate stem: false 25.32/11.03 [2019-03-28 12:43:52,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.32/11.03 [2019-03-28 12:43:52,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.32/11.03 [2019-03-28 12:43:52,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.32/11.03 [2019-03-28 12:43:52,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.32/11.03 [2019-03-28 12:43:52,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.32/11.03 [2019-03-28 12:43:52,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.32/11.03 [2019-03-28 12:43:52,259 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.32/11.03 [2019-03-28 12:43:52,266 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 25.32/11.03 [2019-03-28 12:43:52,266 INFO L444 ModelExtractionUtils]: 34 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. 25.32/11.03 [2019-03-28 12:43:52,266 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.32/11.03 [2019-03-28 12:43:52,267 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 25.32/11.03 [2019-03-28 12:43:52,268 INFO L518 LassoAnalysis]: Proved termination. 25.32/11.03 [2019-03-28 12:43:52,268 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.32/11.03 Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 25.32/11.03 Supporting invariants [] 25.32/11.03 [2019-03-28 12:43:52,284 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed 25.32/11.03 [2019-03-28 12:43:52,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.32/11.03 [2019-03-28 12:43:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.03 [2019-03-28 12:43:52,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjunts are in the unsatisfiable core 25.32/11.03 [2019-03-28 12:43:52,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.32/11.03 [2019-03-28 12:43:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.03 [2019-03-28 12:43:52,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core 25.32/11.03 [2019-03-28 12:43:52,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.32/11.03 [2019-03-28 12:43:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.32/11.03 [2019-03-28 12:43:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.03 [2019-03-28 12:43:52,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core 25.32/11.03 [2019-03-28 12:43:52,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.32/11.03 [2019-03-28 12:43:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.32/11.03 [2019-03-28 12:43:52,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core 25.32/11.03 [2019-03-28 12:43:52,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.32/11.03 [2019-03-28 12:43:52,405 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 25.32/11.03 [2019-03-28 12:43:52,405 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 25.32/11.03 [2019-03-28 12:43:52,405 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 34 states and 39 transitions. cyclomatic complexity: 7 Second operand 3 states. 25.32/11.03 [2019-03-28 12:43:52,466 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 34 states and 39 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 69 states and 79 transitions. Complement of second has 6 states. 25.32/11.03 [2019-03-28 12:43:52,466 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 25.32/11.03 [2019-03-28 12:43:52,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 25.32/11.03 [2019-03-28 12:43:52,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. 25.32/11.03 [2019-03-28 12:43:52,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 13 letters. Loop has 7 letters. 25.32/11.03 [2019-03-28 12:43:52,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.32/11.03 [2019-03-28 12:43:52,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 20 letters. Loop has 7 letters. 25.32/11.03 [2019-03-28 12:43:52,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.32/11.03 [2019-03-28 12:43:52,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 13 letters. Loop has 14 letters. 25.32/11.03 [2019-03-28 12:43:52,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.32/11.03 [2019-03-28 12:43:52,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 79 transitions. 25.32/11.03 [2019-03-28 12:43:52,473 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 25.32/11.03 [2019-03-28 12:43:52,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. 25.32/11.03 [2019-03-28 12:43:52,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 25.32/11.03 [2019-03-28 12:43:52,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 25.32/11.03 [2019-03-28 12:43:52,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 25.32/11.03 [2019-03-28 12:43:52,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.32/11.03 [2019-03-28 12:43:52,474 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.32/11.03 [2019-03-28 12:43:52,498 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.32/11.03 [2019-03-28 12:43:52,500 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.32/11.03 [2019-03-28 12:43:52,500 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 25.32/11.03 [2019-03-28 12:43:52,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 25.32/11.03 [2019-03-28 12:43:52,500 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 25.32/11.03 [2019-03-28 12:43:52,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 25.32/11.03 [2019-03-28 12:43:52,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:43:52 BasicIcfg 25.32/11.03 [2019-03-28 12:43:52,507 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 25.32/11.03 [2019-03-28 12:43:52,507 INFO L168 Benchmark]: Toolchain (without parser) took 6593.35 ms. Allocated memory was 649.6 MB in the beginning and 853.0 MB in the end (delta: 203.4 MB). Free memory was 565.0 MB in the beginning and 809.3 MB in the end (delta: -244.3 MB). Peak memory consumption was 319.7 MB. Max. memory is 50.3 GB. 25.32/11.03 [2019-03-28 12:43:52,508 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 25.32/11.03 [2019-03-28 12:43:52,508 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.12 ms. Allocated memory was 649.6 MB in the beginning and 667.9 MB in the end (delta: 18.4 MB). Free memory was 565.0 MB in the beginning and 634.1 MB in the end (delta: -69.2 MB). Peak memory consumption was 31.8 MB. Max. memory is 50.3 GB. 25.32/11.03 [2019-03-28 12:43:52,509 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.04 ms. Allocated memory is still 667.9 MB. Free memory was 634.1 MB in the beginning and 631.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 25.32/11.03 [2019-03-28 12:43:52,510 INFO L168 Benchmark]: Boogie Preprocessor took 26.54 ms. Allocated memory is still 667.9 MB. Free memory was 631.0 MB in the beginning and 628.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 25.32/11.03 [2019-03-28 12:43:52,510 INFO L168 Benchmark]: RCFGBuilder took 314.08 ms. Allocated memory is still 667.9 MB. Free memory was 628.4 MB in the beginning and 608.2 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 50.3 GB. 25.32/11.03 [2019-03-28 12:43:52,511 INFO L168 Benchmark]: BlockEncodingV2 took 136.56 ms. Allocated memory is still 667.9 MB. Free memory was 608.2 MB in the beginning and 598.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 25.32/11.03 [2019-03-28 12:43:52,511 INFO L168 Benchmark]: TraceAbstraction took 1603.37 ms. Allocated memory is still 667.9 MB. Free memory was 598.8 MB in the beginning and 432.2 MB in the end (delta: 166.6 MB). Peak memory consumption was 166.6 MB. Max. memory is 50.3 GB. 25.32/11.03 [2019-03-28 12:43:52,512 INFO L168 Benchmark]: BuchiAutomizer took 4155.49 ms. Allocated memory was 667.9 MB in the beginning and 853.0 MB in the end (delta: 185.1 MB). Free memory was 432.2 MB in the beginning and 809.3 MB in the end (delta: -377.1 MB). Peak memory consumption was 168.6 MB. Max. memory is 50.3 GB. 25.32/11.03 [2019-03-28 12:43:52,516 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 25.32/11.03 --- Results --- 25.32/11.03 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 25.32/11.03 - StatisticsResult: Initial Icfg 25.32/11.03 32 locations, 37 edges 25.32/11.03 - StatisticsResult: Encoded RCFG 25.32/11.03 23 locations, 39 edges 25.32/11.03 * Results from de.uni_freiburg.informatik.ultimate.core: 25.32/11.03 - StatisticsResult: Toolchain Benchmarks 25.32/11.03 Benchmark results are: 25.32/11.03 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 25.32/11.03 * CACSL2BoogieTranslator took 309.12 ms. Allocated memory was 649.6 MB in the beginning and 667.9 MB in the end (delta: 18.4 MB). Free memory was 565.0 MB in the beginning and 634.1 MB in the end (delta: -69.2 MB). Peak memory consumption was 31.8 MB. Max. memory is 50.3 GB. 25.32/11.03 * Boogie Procedure Inliner took 43.04 ms. Allocated memory is still 667.9 MB. Free memory was 634.1 MB in the beginning and 631.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 25.32/11.03 * Boogie Preprocessor took 26.54 ms. Allocated memory is still 667.9 MB. Free memory was 631.0 MB in the beginning and 628.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 25.32/11.03 * RCFGBuilder took 314.08 ms. Allocated memory is still 667.9 MB. Free memory was 628.4 MB in the beginning and 608.2 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 50.3 GB. 25.32/11.03 * BlockEncodingV2 took 136.56 ms. Allocated memory is still 667.9 MB. Free memory was 608.2 MB in the beginning and 598.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 25.32/11.03 * TraceAbstraction took 1603.37 ms. Allocated memory is still 667.9 MB. Free memory was 598.8 MB in the beginning and 432.2 MB in the end (delta: 166.6 MB). Peak memory consumption was 166.6 MB. Max. memory is 50.3 GB. 25.32/11.03 * BuchiAutomizer took 4155.49 ms. Allocated memory was 667.9 MB in the beginning and 853.0 MB in the end (delta: 185.1 MB). Free memory was 432.2 MB in the beginning and 809.3 MB in the end (delta: -377.1 MB). Peak memory consumption was 168.6 MB. Max. memory is 50.3 GB. 25.32/11.03 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 25.32/11.03 - GenericResult: Unfinished Backtranslation 25.32/11.03 unknown boogie variable #length 25.32/11.03 - GenericResult: Unfinished Backtranslation 25.32/11.03 unknown boogie variable #length 25.32/11.03 - GenericResult: Unfinished Backtranslation 25.32/11.03 unknown boogie variable #length 25.32/11.03 - GenericResult: Unfinished Backtranslation 25.32/11.03 unknown boogie variable #length 25.32/11.03 - GenericResult: Unfinished Backtranslation 25.32/11.03 unknown boogie variable #length 25.32/11.03 - GenericResult: Unfinished Backtranslation 25.32/11.03 unknown boogie variable #length 25.32/11.03 - GenericResult: Unfinished Backtranslation 25.32/11.03 unknown boogie variable #length 25.32/11.03 - GenericResult: Unfinished Backtranslation 25.32/11.03 unknown boogie variable #length 25.32/11.03 - GenericResult: Unfinished Backtranslation 25.32/11.03 unknown boogie variable #length 25.32/11.03 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 25.32/11.03 - PositiveResult [Line: 14]: pointer dereference always succeeds 25.32/11.03 For all program executions holds that pointer dereference always succeeds at this location 25.32/11.03 - PositiveResult [Line: 11]: pointer dereference always succeeds 25.32/11.03 For all program executions holds that pointer dereference always succeeds at this location 25.32/11.03 - PositiveResult [Line: 14]: pointer dereference always succeeds 25.32/11.03 For all program executions holds that pointer dereference always succeeds at this location 25.32/11.03 - PositiveResult [Line: 12]: pointer dereference always succeeds 25.32/11.03 For all program executions holds that pointer dereference always succeeds at this location 25.32/11.03 - PositiveResult [Line: 12]: pointer dereference always succeeds 25.32/11.03 For all program executions holds that pointer dereference always succeeds at this location 25.32/11.03 - PositiveResult [Line: 10]: pointer dereference always succeeds 25.32/11.03 For all program executions holds that pointer dereference always succeeds at this location 25.32/11.03 - PositiveResult [Line: 12]: pointer dereference always succeeds 25.32/11.03 For all program executions holds that pointer dereference always succeeds at this location 25.32/11.03 - PositiveResult [Line: 10]: pointer dereference always succeeds 25.32/11.03 For all program executions holds that pointer dereference always succeeds at this location 25.32/11.03 - PositiveResult [Line: 11]: pointer dereference always succeeds 25.32/11.03 For all program executions holds that pointer dereference always succeeds at this location 25.32/11.03 - PositiveResult [Line: 12]: pointer dereference always succeeds 25.32/11.03 For all program executions holds that pointer dereference always succeeds at this location 25.32/11.03 - AllSpecificationsHoldResult: All specifications hold 25.32/11.03 10 specifications checked. All of them hold 25.32/11.03 - InvariantResult [Line: 8]: Loop Invariant 25.32/11.03 [2019-03-28 12:43:52,525 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.32/11.03 [2019-03-28 12:43:52,526 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.32/11.03 Derived loop invariant: ((0 == a && 4 * array_size <= unknown-#length-unknown[a]) && 1 == \valid[a]) && 1 <= i 25.32/11.03 - InvariantResult [Line: 11]: Loop Invariant 25.32/11.03 [2019-03-28 12:43:52,527 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.32/11.03 [2019-03-28 12:43:52,527 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.32/11.03 [2019-03-28 12:43:52,527 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.32/11.03 [2019-03-28 12:43:52,528 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.32/11.03 [2019-03-28 12:43:52,528 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.32/11.03 [2019-03-28 12:43:52,528 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.32/11.03 Derived loop invariant: (((((0 == a && 4 * array_size <= unknown-#length-unknown[a]) && 0 <= j) && 4 * i + 4 <= unknown-#length-unknown[a]) && 1 == \valid[a]) && 4 * j + 4 <= unknown-#length-unknown[a]) && 1 <= i 25.32/11.03 - StatisticsResult: Ultimate Automizer benchmark data 25.32/11.03 CFG has 1 procedures, 23 locations, 10 error locations. SAFE Result, 1.5s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 67 SDtfs, 266 SDslu, 74 SDs, 0 SdLazy, 243 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 59 HoareAnnotationTreeSize, 2 FomulaSimplifications, 635 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 3721 SizeOfPredicates, 3 NumberOfNonLiveVariables, 73 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 7/11 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 25.32/11.03 - StatisticsResult: Constructed decomposition of program 25.32/11.03 Your program was decomposed into 8 terminating modules (5 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function -1 * a + -4 * i + unknown-#length-unknown[a] and consists of 4 locations. One nondeterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function j and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 5 locations. 25.32/11.03 - StatisticsResult: Timing statistics 25.32/11.03 BüchiAutomizer plugin needed 4.1s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 3.1s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 72 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 46 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 99 SDtfs, 258 SDslu, 152 SDs, 0 SdLazy, 290 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital158 mio100 ax100 hnf100 lsp96 ukn73 mio100 lsp62 div100 bol100 ite100 ukn100 eq181 hnf86 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 104ms VariablesStem: 10 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 25.32/11.03 - TerminationAnalysisResult: Termination proven 25.32/11.03 Buchi Automizer proved that your program is terminating 25.32/11.03 RESULT: Ultimate proved your program to be correct! 25.32/11.03 !SESSION 2019-03-28 12:43:42.639 ----------------------------------------------- 25.32/11.03 eclipse.buildId=unknown 25.32/11.03 java.version=1.8.0_181 25.32/11.03 java.vendor=Oracle Corporation 25.32/11.03 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 25.32/11.03 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 25.32/11.03 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 25.32/11.03 25.32/11.03 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:43:52.754 25.32/11.03 !MESSAGE The workspace will exit with unsaved changes in this session. 25.32/11.03 Received shutdown request... 25.32/11.03 Ultimate: 25.32/11.03 GTK+ Version Check 25.32/11.03 EOF