25.97/11.45 YES 25.97/11.45 25.97/11.45 Ultimate: Cannot open display: 25.97/11.45 This is Ultimate 0.1.24-8dc7c08-m 25.97/11.45 [2019-03-28 12:46:15,702 INFO L170 SettingsManager]: Resetting all preferences to default values... 25.97/11.45 [2019-03-28 12:46:15,704 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 25.97/11.45 [2019-03-28 12:46:15,716 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 25.97/11.45 [2019-03-28 12:46:15,717 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 25.97/11.45 [2019-03-28 12:46:15,718 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 25.97/11.45 [2019-03-28 12:46:15,719 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 25.97/11.45 [2019-03-28 12:46:15,721 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 25.97/11.45 [2019-03-28 12:46:15,722 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 25.97/11.45 [2019-03-28 12:46:15,723 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 25.97/11.45 [2019-03-28 12:46:15,724 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 25.97/11.45 [2019-03-28 12:46:15,724 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 25.97/11.45 [2019-03-28 12:46:15,725 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 25.97/11.45 [2019-03-28 12:46:15,726 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 25.97/11.45 [2019-03-28 12:46:15,727 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 25.97/11.45 [2019-03-28 12:46:15,728 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 25.97/11.45 [2019-03-28 12:46:15,729 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 25.97/11.45 [2019-03-28 12:46:15,730 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 25.97/11.45 [2019-03-28 12:46:15,732 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 25.97/11.45 [2019-03-28 12:46:15,734 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 25.97/11.45 [2019-03-28 12:46:15,735 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 25.97/11.45 [2019-03-28 12:46:15,736 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 25.97/11.45 [2019-03-28 12:46:15,738 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 25.97/11.45 [2019-03-28 12:46:15,739 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 25.97/11.45 [2019-03-28 12:46:15,739 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 25.97/11.45 [2019-03-28 12:46:15,739 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 25.97/11.45 [2019-03-28 12:46:15,740 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 25.97/11.45 [2019-03-28 12:46:15,741 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 25.97/11.45 [2019-03-28 12:46:15,741 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 25.97/11.45 [2019-03-28 12:46:15,742 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 25.97/11.45 [2019-03-28 12:46:15,742 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 25.97/11.45 [2019-03-28 12:46:15,743 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 25.97/11.45 [2019-03-28 12:46:15,744 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 25.97/11.45 [2019-03-28 12:46:15,744 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 25.97/11.45 [2019-03-28 12:46:15,745 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 25.97/11.45 [2019-03-28 12:46:15,745 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 25.97/11.45 [2019-03-28 12:46:15,745 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 25.97/11.45 [2019-03-28 12:46:15,746 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 25.97/11.45 [2019-03-28 12:46:15,747 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 25.97/11.45 [2019-03-28 12:46:15,747 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 25.97/11.45 [2019-03-28 12:46:15,762 INFO L110 SettingsManager]: Loading preferences was successful 25.97/11.45 [2019-03-28 12:46:15,762 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 25.97/11.45 [2019-03-28 12:46:15,764 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 25.97/11.45 [2019-03-28 12:46:15,764 INFO L133 SettingsManager]: * Rewrite not-equals=true 25.97/11.45 [2019-03-28 12:46:15,764 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 25.97/11.45 [2019-03-28 12:46:15,764 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 25.97/11.45 [2019-03-28 12:46:15,764 INFO L133 SettingsManager]: * Use SBE=true 25.97/11.45 [2019-03-28 12:46:15,765 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 25.97/11.45 [2019-03-28 12:46:15,765 INFO L133 SettingsManager]: * Use old map elimination=false 25.97/11.45 [2019-03-28 12:46:15,765 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 25.97/11.45 [2019-03-28 12:46:15,765 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 25.97/11.45 [2019-03-28 12:46:15,765 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 25.97/11.45 [2019-03-28 12:46:15,766 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 25.97/11.45 [2019-03-28 12:46:15,766 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 25.97/11.45 [2019-03-28 12:46:15,766 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.97/11.45 [2019-03-28 12:46:15,766 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 25.97/11.45 [2019-03-28 12:46:15,766 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 25.97/11.45 [2019-03-28 12:46:15,767 INFO L133 SettingsManager]: * Check division by zero=IGNORE 25.97/11.45 [2019-03-28 12:46:15,767 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 25.97/11.45 [2019-03-28 12:46:15,767 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 25.97/11.45 [2019-03-28 12:46:15,767 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 25.97/11.45 [2019-03-28 12:46:15,767 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 25.97/11.45 [2019-03-28 12:46:15,768 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 25.97/11.45 [2019-03-28 12:46:15,768 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 25.97/11.45 [2019-03-28 12:46:15,768 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 25.97/11.45 [2019-03-28 12:46:15,768 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 25.97/11.45 [2019-03-28 12:46:15,768 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 25.97/11.45 [2019-03-28 12:46:15,769 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 25.97/11.45 [2019-03-28 12:46:15,769 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 25.97/11.45 [2019-03-28 12:46:15,796 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 25.97/11.45 [2019-03-28 12:46:15,810 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 25.97/11.45 [2019-03-28 12:46:15,813 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 25.97/11.45 [2019-03-28 12:46:15,815 INFO L271 PluginConnector]: Initializing CDTParser... 25.97/11.45 [2019-03-28 12:46:15,815 INFO L276 PluginConnector]: CDTParser initialized 25.97/11.45 [2019-03-28 12:46:15,816 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 25.97/11.45 [2019-03-28 12:46:15,879 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/4c69ca71d02740b8b07aaf198ff41d1f/FLAG0ca5f90c2 25.97/11.45 [2019-03-28 12:46:16,233 INFO L307 CDTParser]: Found 1 translation units. 25.97/11.45 [2019-03-28 12:46:16,234 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 25.97/11.45 [2019-03-28 12:46:16,234 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 25.97/11.45 [2019-03-28 12:46:16,241 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/4c69ca71d02740b8b07aaf198ff41d1f/FLAG0ca5f90c2 25.97/11.45 [2019-03-28 12:46:16,640 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/4c69ca71d02740b8b07aaf198ff41d1f 25.97/11.45 [2019-03-28 12:46:16,651 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 25.97/11.45 [2019-03-28 12:46:16,653 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 25.97/11.45 [2019-03-28 12:46:16,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 25.97/11.45 [2019-03-28 12:46:16,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 25.97/11.45 [2019-03-28 12:46:16,658 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 25.97/11.45 [2019-03-28 12:46:16,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:46:16" (1/1) ... 25.97/11.45 [2019-03-28 12:46:16,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f67804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:16, skipping insertion in model container 25.97/11.45 [2019-03-28 12:46:16,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:46:16" (1/1) ... 25.97/11.45 [2019-03-28 12:46:16,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 25.97/11.45 [2019-03-28 12:46:16,687 INFO L176 MainTranslator]: Built tables and reachable declarations 25.97/11.45 [2019-03-28 12:46:16,850 INFO L206 PostProcessor]: Analyzing one entry point: main 25.97/11.45 [2019-03-28 12:46:16,862 INFO L191 MainTranslator]: Completed pre-run 25.97/11.45 [2019-03-28 12:46:16,936 INFO L206 PostProcessor]: Analyzing one entry point: main 25.97/11.45 [2019-03-28 12:46:16,952 INFO L195 MainTranslator]: Completed translation 25.97/11.45 [2019-03-28 12:46:16,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:16 WrapperNode 25.97/11.45 [2019-03-28 12:46:16,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 25.97/11.45 [2019-03-28 12:46:16,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 25.97/11.45 [2019-03-28 12:46:16,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 25.97/11.45 [2019-03-28 12:46:16,954 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 25.97/11.45 [2019-03-28 12:46:16,963 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:46:16" (1/1) ... 25.97/11.45 [2019-03-28 12:46:16,971 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:46:16" (1/1) ... 25.97/11.45 [2019-03-28 12:46:16,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 25.97/11.45 [2019-03-28 12:46:16,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 25.97/11.45 [2019-03-28 12:46:16,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 25.97/11.45 [2019-03-28 12:46:16,994 INFO L276 PluginConnector]: Boogie Preprocessor initialized 25.97/11.45 [2019-03-28 12:46:17,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:16" (1/1) ... 25.97/11.45 [2019-03-28 12:46:17,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:16" (1/1) ... 25.97/11.45 [2019-03-28 12:46:17,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:16" (1/1) ... 25.97/11.45 [2019-03-28 12:46:17,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:16" (1/1) ... 25.97/11.45 [2019-03-28 12:46:17,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:16" (1/1) ... 25.97/11.45 [2019-03-28 12:46:17,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:16" (1/1) ... 25.97/11.45 [2019-03-28 12:46:17,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:16" (1/1) ... 25.97/11.45 [2019-03-28 12:46:17,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 25.97/11.45 [2019-03-28 12:46:17,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 25.97/11.45 [2019-03-28 12:46:17,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... 25.97/11.45 [2019-03-28 12:46:17,020 INFO L276 PluginConnector]: RCFGBuilder initialized 25.97/11.45 [2019-03-28 12:46:17,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:16" (1/1) ... 25.97/11.45 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.97/11.45 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 25.97/11.45 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 25.97/11.45 [2019-03-28 12:46:17,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 25.97/11.45 [2019-03-28 12:46:17,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 25.97/11.45 [2019-03-28 12:46:17,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 25.97/11.45 [2019-03-28 12:46:17,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 25.97/11.45 [2019-03-28 12:46:17,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 25.97/11.45 [2019-03-28 12:46:17,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 25.97/11.45 [2019-03-28 12:46:17,298 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 25.97/11.45 [2019-03-28 12:46:17,299 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 25.97/11.45 [2019-03-28 12:46:17,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:17 BoogieIcfgContainer 25.97/11.45 [2019-03-28 12:46:17,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 25.97/11.45 [2019-03-28 12:46:17,301 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 25.97/11.45 [2019-03-28 12:46:17,301 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 25.97/11.45 [2019-03-28 12:46:17,304 INFO L276 PluginConnector]: BlockEncodingV2 initialized 25.97/11.45 [2019-03-28 12:46:17,305 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:17" (1/1) ... 25.97/11.45 [2019-03-28 12:46:17,321 INFO L313 BlockEncoder]: Initial Icfg 30 locations, 38 edges 25.97/11.45 [2019-03-28 12:46:17,323 INFO L258 BlockEncoder]: Using Remove infeasible edges 25.97/11.45 [2019-03-28 12:46:17,323 INFO L263 BlockEncoder]: Using Maximize final states 25.97/11.45 [2019-03-28 12:46:17,324 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 25.97/11.45 [2019-03-28 12:46:17,324 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 25.97/11.45 [2019-03-28 12:46:17,326 INFO L296 BlockEncoder]: Using Remove sink states 25.97/11.45 [2019-03-28 12:46:17,327 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 25.97/11.45 [2019-03-28 12:46:17,327 INFO L179 BlockEncoder]: Using Rewrite not-equals 25.97/11.45 [2019-03-28 12:46:17,348 INFO L185 BlockEncoder]: Using Use SBE 25.97/11.45 [2019-03-28 12:46:17,373 INFO L200 BlockEncoder]: SBE split 10 edges 25.97/11.45 [2019-03-28 12:46:17,378 INFO L70 emoveInfeasibleEdges]: Removed 3 edges and 0 locations because of local infeasibility 25.97/11.45 [2019-03-28 12:46:17,380 INFO L71 MaximizeFinalStates]: 0 new accepting states 25.97/11.45 [2019-03-28 12:46:17,412 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding 25.97/11.45 [2019-03-28 12:46:17,415 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 25.97/11.45 [2019-03-28 12:46:17,416 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 25.97/11.45 [2019-03-28 12:46:17,417 INFO L71 MaximizeFinalStates]: 0 new accepting states 25.97/11.45 [2019-03-28 12:46:17,417 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 25.97/11.45 [2019-03-28 12:46:17,418 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 25.97/11.45 [2019-03-28 12:46:17,418 INFO L313 BlockEncoder]: Encoded RCFG 20 locations, 36 edges 25.97/11.45 [2019-03-28 12:46:17,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:46:17 BasicIcfg 25.97/11.45 [2019-03-28 12:46:17,419 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 25.97/11.45 [2019-03-28 12:46:17,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 25.97/11.45 [2019-03-28 12:46:17,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... 25.97/11.45 [2019-03-28 12:46:17,423 INFO L276 PluginConnector]: TraceAbstraction initialized 25.97/11.45 [2019-03-28 12:46:17,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:46:16" (1/4) ... 25.97/11.45 [2019-03-28 12:46:17,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd1dd3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:46:17, skipping insertion in model container 25.97/11.45 [2019-03-28 12:46:17,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:16" (2/4) ... 25.97/11.45 [2019-03-28 12:46:17,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd1dd3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:46:17, skipping insertion in model container 25.97/11.45 [2019-03-28 12:46:17,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:17" (3/4) ... 25.97/11.45 [2019-03-28 12:46:17,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd1dd3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:46:17, skipping insertion in model container 25.97/11.45 [2019-03-28 12:46:17,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:46:17" (4/4) ... 25.97/11.45 [2019-03-28 12:46:17,427 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 25.97/11.45 [2019-03-28 12:46:17,438 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 25.97/11.45 [2019-03-28 12:46:17,446 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. 25.97/11.45 [2019-03-28 12:46:17,463 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. 25.97/11.45 [2019-03-28 12:46:17,492 INFO L133 ementStrategyFactory]: Using default assertion order modulation 25.97/11.45 [2019-03-28 12:46:17,493 INFO L382 AbstractCegarLoop]: Interprodecural is true 25.97/11.45 [2019-03-28 12:46:17,493 INFO L383 AbstractCegarLoop]: Hoare is true 25.97/11.45 [2019-03-28 12:46:17,493 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 25.97/11.45 [2019-03-28 12:46:17,493 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 25.97/11.45 [2019-03-28 12:46:17,493 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 25.97/11.45 [2019-03-28 12:46:17,493 INFO L387 AbstractCegarLoop]: Difference is false 25.97/11.45 [2019-03-28 12:46:17,494 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 25.97/11.45 [2019-03-28 12:46:17,494 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 25.97/11.45 [2019-03-28 12:46:17,509 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. 25.97/11.45 [2019-03-28 12:46:17,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 25.97/11.45 [2019-03-28 12:46:17,515 INFO L394 BasicCegarLoop]: Found error trace 25.97/11.45 [2019-03-28 12:46:17,516 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 25.97/11.45 [2019-03-28 12:46:17,516 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 25.97/11.45 [2019-03-28 12:46:17,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:17,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1674118285, now seen corresponding path program 1 times 25.97/11.45 [2019-03-28 12:46:17,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:17,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:17,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:17,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:17,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.97/11.45 [2019-03-28 12:46:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.97/11.45 [2019-03-28 12:46:17,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.97/11.45 [2019-03-28 12:46:17,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.97/11.45 [2019-03-28 12:46:17,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 25.97/11.45 [2019-03-28 12:46:17,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.97/11.45 [2019-03-28 12:46:17,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.97/11.45 [2019-03-28 12:46:17,704 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. 25.97/11.45 [2019-03-28 12:46:17,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.97/11.45 [2019-03-28 12:46:17,853 INFO L93 Difference]: Finished difference Result 53 states and 94 transitions. 25.97/11.45 [2019-03-28 12:46:17,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.97/11.45 [2019-03-28 12:46:17,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 25.97/11.45 [2019-03-28 12:46:17,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.97/11.45 [2019-03-28 12:46:17,869 INFO L225 Difference]: With dead ends: 53 25.97/11.45 [2019-03-28 12:46:17,869 INFO L226 Difference]: Without dead ends: 37 25.97/11.45 [2019-03-28 12:46:17,873 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.97/11.45 [2019-03-28 12:46:17,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. 25.97/11.45 [2019-03-28 12:46:17,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 21. 25.97/11.45 [2019-03-28 12:46:17,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 25.97/11.45 [2019-03-28 12:46:17,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. 25.97/11.45 [2019-03-28 12:46:17,914 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 7 25.97/11.45 [2019-03-28 12:46:17,914 INFO L84 Accepts]: Finished accepts. word is rejected. 25.97/11.45 [2019-03-28 12:46:17,914 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. 25.97/11.45 [2019-03-28 12:46:17,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 25.97/11.45 [2019-03-28 12:46:17,915 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. 25.97/11.45 [2019-03-28 12:46:17,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 25.97/11.45 [2019-03-28 12:46:17,915 INFO L394 BasicCegarLoop]: Found error trace 25.97/11.45 [2019-03-28 12:46:17,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 25.97/11.45 [2019-03-28 12:46:17,916 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 25.97/11.45 [2019-03-28 12:46:17,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:17,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1674088494, now seen corresponding path program 1 times 25.97/11.45 [2019-03-28 12:46:17,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:17,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:17,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:17,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:17,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.97/11.45 [2019-03-28 12:46:17,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.97/11.45 [2019-03-28 12:46:17,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.97/11.45 [2019-03-28 12:46:17,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.97/11.45 [2019-03-28 12:46:17,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 25.97/11.45 [2019-03-28 12:46:17,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.97/11.45 [2019-03-28 12:46:17,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.97/11.45 [2019-03-28 12:46:17,976 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 3 states. 25.97/11.45 [2019-03-28 12:46:18,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.97/11.45 [2019-03-28 12:46:18,027 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. 25.97/11.45 [2019-03-28 12:46:18,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.97/11.45 [2019-03-28 12:46:18,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 25.97/11.45 [2019-03-28 12:46:18,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.97/11.45 [2019-03-28 12:46:18,029 INFO L225 Difference]: With dead ends: 21 25.97/11.45 [2019-03-28 12:46:18,029 INFO L226 Difference]: Without dead ends: 17 25.97/11.45 [2019-03-28 12:46:18,030 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.97/11.45 [2019-03-28 12:46:18,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 25.97/11.45 [2019-03-28 12:46:18,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 25.97/11.45 [2019-03-28 12:46:18,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 25.97/11.45 [2019-03-28 12:46:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. 25.97/11.45 [2019-03-28 12:46:18,034 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 7 25.97/11.45 [2019-03-28 12:46:18,034 INFO L84 Accepts]: Finished accepts. word is rejected. 25.97/11.45 [2019-03-28 12:46:18,034 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. 25.97/11.45 [2019-03-28 12:46:18,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 25.97/11.45 [2019-03-28 12:46:18,034 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. 25.97/11.45 [2019-03-28 12:46:18,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 25.97/11.45 [2019-03-28 12:46:18,035 INFO L394 BasicCegarLoop]: Found error trace 25.97/11.45 [2019-03-28 12:46:18,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 25.97/11.45 [2019-03-28 12:46:18,035 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 25.97/11.45 [2019-03-28 12:46:18,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:18,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1674088492, now seen corresponding path program 1 times 25.97/11.45 [2019-03-28 12:46:18,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:18,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:18,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:18,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:18,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.97/11.45 [2019-03-28 12:46:18,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.97/11.45 [2019-03-28 12:46:18,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.97/11.45 [2019-03-28 12:46:18,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.97/11.45 [2019-03-28 12:46:18,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 25.97/11.45 [2019-03-28 12:46:18,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 25.97/11.45 [2019-03-28 12:46:18,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 25.97/11.45 [2019-03-28 12:46:18,074 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 4 states. 25.97/11.45 [2019-03-28 12:46:18,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.97/11.45 [2019-03-28 12:46:18,145 INFO L93 Difference]: Finished difference Result 41 states and 69 transitions. 25.97/11.45 [2019-03-28 12:46:18,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 25.97/11.45 [2019-03-28 12:46:18,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 25.97/11.45 [2019-03-28 12:46:18,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.97/11.45 [2019-03-28 12:46:18,147 INFO L225 Difference]: With dead ends: 41 25.97/11.45 [2019-03-28 12:46:18,147 INFO L226 Difference]: Without dead ends: 29 25.97/11.45 [2019-03-28 12:46:18,148 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.97/11.45 [2019-03-28 12:46:18,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 25.97/11.45 [2019-03-28 12:46:18,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. 25.97/11.45 [2019-03-28 12:46:18,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 25.97/11.45 [2019-03-28 12:46:18,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 33 transitions. 25.97/11.45 [2019-03-28 12:46:18,152 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 33 transitions. Word has length 7 25.97/11.45 [2019-03-28 12:46:18,153 INFO L84 Accepts]: Finished accepts. word is rejected. 25.97/11.45 [2019-03-28 12:46:18,153 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 33 transitions. 25.97/11.45 [2019-03-28 12:46:18,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 25.97/11.45 [2019-03-28 12:46:18,153 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 33 transitions. 25.97/11.45 [2019-03-28 12:46:18,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 25.97/11.45 [2019-03-28 12:46:18,154 INFO L394 BasicCegarLoop]: Found error trace 25.97/11.45 [2019-03-28 12:46:18,154 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 25.97/11.45 [2019-03-28 12:46:18,154 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 25.97/11.45 [2019-03-28 12:46:18,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:18,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1674088491, now seen corresponding path program 1 times 25.97/11.45 [2019-03-28 12:46:18,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:18,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:18,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:18,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:18,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.97/11.45 [2019-03-28 12:46:18,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.97/11.45 [2019-03-28 12:46:18,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.97/11.45 [2019-03-28 12:46:18,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.97/11.45 [2019-03-28 12:46:18,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 25.97/11.45 [2019-03-28 12:46:18,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 25.97/11.45 [2019-03-28 12:46:18,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 25.97/11.45 [2019-03-28 12:46:18,202 INFO L87 Difference]: Start difference. First operand 20 states and 33 transitions. Second operand 4 states. 25.97/11.45 [2019-03-28 12:46:18,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.97/11.45 [2019-03-28 12:46:18,295 INFO L93 Difference]: Finished difference Result 21 states and 33 transitions. 25.97/11.45 [2019-03-28 12:46:18,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 25.97/11.45 [2019-03-28 12:46:18,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 25.97/11.45 [2019-03-28 12:46:18,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.97/11.45 [2019-03-28 12:46:18,296 INFO L225 Difference]: With dead ends: 21 25.97/11.45 [2019-03-28 12:46:18,296 INFO L226 Difference]: Without dead ends: 20 25.97/11.45 [2019-03-28 12:46:18,297 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.97/11.45 [2019-03-28 12:46:18,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 25.97/11.45 [2019-03-28 12:46:18,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 25.97/11.45 [2019-03-28 12:46:18,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 25.97/11.45 [2019-03-28 12:46:18,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. 25.97/11.45 [2019-03-28 12:46:18,301 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 31 transitions. Word has length 7 25.97/11.45 [2019-03-28 12:46:18,301 INFO L84 Accepts]: Finished accepts. word is rejected. 25.97/11.45 [2019-03-28 12:46:18,301 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 31 transitions. 25.97/11.45 [2019-03-28 12:46:18,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 25.97/11.45 [2019-03-28 12:46:18,302 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 31 transitions. 25.97/11.45 [2019-03-28 12:46:18,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 25.97/11.45 [2019-03-28 12:46:18,302 INFO L394 BasicCegarLoop]: Found error trace 25.97/11.45 [2019-03-28 12:46:18,302 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 25.97/11.45 [2019-03-28 12:46:18,302 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 25.97/11.45 [2019-03-28 12:46:18,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:18,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1674028038, now seen corresponding path program 1 times 25.97/11.45 [2019-03-28 12:46:18,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:18,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:18,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:18,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:18,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.97/11.45 [2019-03-28 12:46:18,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.97/11.45 [2019-03-28 12:46:18,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.97/11.45 [2019-03-28 12:46:18,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 25.97/11.45 [2019-03-28 12:46:18,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 25.97/11.45 [2019-03-28 12:46:18,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 25.97/11.45 [2019-03-28 12:46:18,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 25.97/11.45 [2019-03-28 12:46:18,331 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. Second operand 4 states. 25.97/11.45 [2019-03-28 12:46:18,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.97/11.45 [2019-03-28 12:46:18,374 INFO L93 Difference]: Finished difference Result 28 states and 43 transitions. 25.97/11.45 [2019-03-28 12:46:18,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 25.97/11.45 [2019-03-28 12:46:18,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 25.97/11.45 [2019-03-28 12:46:18,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.97/11.45 [2019-03-28 12:46:18,375 INFO L225 Difference]: With dead ends: 28 25.97/11.45 [2019-03-28 12:46:18,376 INFO L226 Difference]: Without dead ends: 20 25.97/11.45 [2019-03-28 12:46:18,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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.97/11.45 [2019-03-28 12:46:18,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 25.97/11.45 [2019-03-28 12:46:18,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 25.97/11.45 [2019-03-28 12:46:18,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 25.97/11.45 [2019-03-28 12:46:18,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. 25.97/11.45 [2019-03-28 12:46:18,380 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 30 transitions. Word has length 7 25.97/11.45 [2019-03-28 12:46:18,380 INFO L84 Accepts]: Finished accepts. word is rejected. 25.97/11.45 [2019-03-28 12:46:18,380 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 30 transitions. 25.97/11.45 [2019-03-28 12:46:18,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 25.97/11.45 [2019-03-28 12:46:18,381 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 30 transitions. 25.97/11.45 [2019-03-28 12:46:18,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 25.97/11.45 [2019-03-28 12:46:18,381 INFO L394 BasicCegarLoop]: Found error trace 25.97/11.45 [2019-03-28 12:46:18,381 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] 25.97/11.45 [2019-03-28 12:46:18,382 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 25.97/11.45 [2019-03-28 12:46:18,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:18,382 INFO L82 PathProgramCache]: Analyzing trace with hash 390572558, now seen corresponding path program 1 times 25.97/11.45 [2019-03-28 12:46:18,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:18,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:18,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:18,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:18,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.97/11.45 [2019-03-28 12:46:18,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.97/11.45 [2019-03-28 12:46:18,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.97/11.45 [2019-03-28 12:46:18,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.97/11.45 [2019-03-28 12:46:18,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 25.97/11.45 [2019-03-28 12:46:18,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.97/11.45 [2019-03-28 12:46:18,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.97/11.45 [2019-03-28 12:46:18,413 INFO L87 Difference]: Start difference. First operand 20 states and 30 transitions. Second operand 3 states. 25.97/11.45 [2019-03-28 12:46:18,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.97/11.45 [2019-03-28 12:46:18,459 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. 25.97/11.45 [2019-03-28 12:46:18,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.97/11.45 [2019-03-28 12:46:18,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 25.97/11.45 [2019-03-28 12:46:18,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.97/11.45 [2019-03-28 12:46:18,460 INFO L225 Difference]: With dead ends: 20 25.97/11.45 [2019-03-28 12:46:18,460 INFO L226 Difference]: Without dead ends: 19 25.97/11.45 [2019-03-28 12:46:18,461 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.97/11.45 [2019-03-28 12:46:18,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. 25.97/11.45 [2019-03-28 12:46:18,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. 25.97/11.45 [2019-03-28 12:46:18,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 25.97/11.45 [2019-03-28 12:46:18,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. 25.97/11.45 [2019-03-28 12:46:18,465 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 26 transitions. Word has length 10 25.97/11.45 [2019-03-28 12:46:18,465 INFO L84 Accepts]: Finished accepts. word is rejected. 25.97/11.45 [2019-03-28 12:46:18,465 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 26 transitions. 25.97/11.45 [2019-03-28 12:46:18,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 25.97/11.45 [2019-03-28 12:46:18,465 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 26 transitions. 25.97/11.45 [2019-03-28 12:46:18,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 25.97/11.45 [2019-03-28 12:46:18,466 INFO L394 BasicCegarLoop]: Found error trace 25.97/11.45 [2019-03-28 12:46:18,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 25.97/11.45 [2019-03-28 12:46:18,466 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 25.97/11.45 [2019-03-28 12:46:18,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:18,466 INFO L82 PathProgramCache]: Analyzing trace with hash 390633012, now seen corresponding path program 1 times 25.97/11.45 [2019-03-28 12:46:18,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:18,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:18,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:18,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:18,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.97/11.45 [2019-03-28 12:46:18,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.97/11.45 [2019-03-28 12:46:18,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.97/11.45 [2019-03-28 12:46:18,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 25.97/11.45 [2019-03-28 12:46:18,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 25.97/11.45 [2019-03-28 12:46:18,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 25.97/11.45 [2019-03-28 12:46:18,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 25.97/11.45 [2019-03-28 12:46:18,515 INFO L87 Difference]: Start difference. First operand 17 states and 26 transitions. Second operand 5 states. 25.97/11.45 [2019-03-28 12:46:18,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.97/11.45 [2019-03-28 12:46:18,612 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. 25.97/11.45 [2019-03-28 12:46:18,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 25.97/11.45 [2019-03-28 12:46:18,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 25.97/11.45 [2019-03-28 12:46:18,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.97/11.45 [2019-03-28 12:46:18,614 INFO L225 Difference]: With dead ends: 20 25.97/11.45 [2019-03-28 12:46:18,614 INFO L226 Difference]: Without dead ends: 17 25.97/11.45 [2019-03-28 12:46:18,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 25.97/11.45 [2019-03-28 12:46:18,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 25.97/11.45 [2019-03-28 12:46:18,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 25.97/11.45 [2019-03-28 12:46:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 25.97/11.45 [2019-03-28 12:46:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. 25.97/11.45 [2019-03-28 12:46:18,618 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 10 25.97/11.45 [2019-03-28 12:46:18,619 INFO L84 Accepts]: Finished accepts. word is rejected. 25.97/11.45 [2019-03-28 12:46:18,619 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. 25.97/11.45 [2019-03-28 12:46:18,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 25.97/11.45 [2019-03-28 12:46:18,619 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. 25.97/11.45 [2019-03-28 12:46:18,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 25.97/11.45 [2019-03-28 12:46:18,619 INFO L394 BasicCegarLoop]: Found error trace 25.97/11.45 [2019-03-28 12:46:18,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 25.97/11.45 [2019-03-28 12:46:18,620 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 25.97/11.45 [2019-03-28 12:46:18,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:18,620 INFO L82 PathProgramCache]: Analyzing trace with hash 390633013, now seen corresponding path program 1 times 25.97/11.45 [2019-03-28 12:46:18,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:18,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:18,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:18,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:18,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.97/11.45 [2019-03-28 12:46:18,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 25.97/11.45 [2019-03-28 12:46:18,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.97/11.45 [2019-03-28 12:46:18,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.97/11.45 [2019-03-28 12:46:18,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 25.97/11.45 [2019-03-28 12:46:18,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 25.97/11.45 [2019-03-28 12:46:18,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 25.97/11.45 [2019-03-28 12:46:18,661 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand 4 states. 25.97/11.45 [2019-03-28 12:46:18,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.97/11.45 [2019-03-28 12:46:18,713 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. 25.97/11.45 [2019-03-28 12:46:18,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 25.97/11.45 [2019-03-28 12:46:18,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 25.97/11.45 [2019-03-28 12:46:18,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.97/11.45 [2019-03-28 12:46:18,715 INFO L225 Difference]: With dead ends: 25 25.97/11.45 [2019-03-28 12:46:18,715 INFO L226 Difference]: Without dead ends: 22 25.97/11.45 [2019-03-28 12:46:18,715 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.97/11.45 [2019-03-28 12:46:18,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 25.97/11.45 [2019-03-28 12:46:18,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 25.97/11.45 [2019-03-28 12:46:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 25.97/11.45 [2019-03-28 12:46:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. 25.97/11.45 [2019-03-28 12:46:18,720 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 10 25.97/11.45 [2019-03-28 12:46:18,721 INFO L84 Accepts]: Finished accepts. word is rejected. 25.97/11.45 [2019-03-28 12:46:18,721 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. 25.97/11.45 [2019-03-28 12:46:18,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 25.97/11.45 [2019-03-28 12:46:18,722 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. 25.97/11.45 [2019-03-28 12:46:18,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 25.97/11.45 [2019-03-28 12:46:18,722 INFO L394 BasicCegarLoop]: Found error trace 25.97/11.45 [2019-03-28 12:46:18,722 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 25.97/11.45 [2019-03-28 12:46:18,723 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 25.97/11.45 [2019-03-28 12:46:18,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:18,723 INFO L82 PathProgramCache]: Analyzing trace with hash -2014379630, now seen corresponding path program 1 times 25.97/11.45 [2019-03-28 12:46:18,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:18,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:18,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:18,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:18,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.97/11.45 [2019-03-28 12:46:18,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 25.97/11.45 [2019-03-28 12:46:18,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.97/11.45 [2019-03-28 12:46:18,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.97/11.45 [2019-03-28 12:46:18,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 25.97/11.45 [2019-03-28 12:46:18,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 25.97/11.45 [2019-03-28 12:46:18,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 25.97/11.45 [2019-03-28 12:46:18,770 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand 4 states. 25.97/11.45 [2019-03-28 12:46:18,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.97/11.45 [2019-03-28 12:46:18,810 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. 25.97/11.45 [2019-03-28 12:46:18,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 25.97/11.45 [2019-03-28 12:46:18,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 25.97/11.45 [2019-03-28 12:46:18,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.97/11.45 [2019-03-28 12:46:18,811 INFO L225 Difference]: With dead ends: 23 25.97/11.45 [2019-03-28 12:46:18,811 INFO L226 Difference]: Without dead ends: 0 25.97/11.45 [2019-03-28 12:46:18,812 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.97/11.45 [2019-03-28 12:46:18,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 25.97/11.45 [2019-03-28 12:46:18,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 25.97/11.45 [2019-03-28 12:46:18,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 25.97/11.45 [2019-03-28 12:46:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 25.97/11.45 [2019-03-28 12:46:18,813 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 25.97/11.45 [2019-03-28 12:46:18,813 INFO L84 Accepts]: Finished accepts. word is rejected. 25.97/11.45 [2019-03-28 12:46:18,813 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 25.97/11.45 [2019-03-28 12:46:18,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 25.97/11.45 [2019-03-28 12:46:18,813 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 25.97/11.45 [2019-03-28 12:46:18,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 25.97/11.45 [2019-03-28 12:46:18,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 25.97/11.45 [2019-03-28 12:46:19,087 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 25.97/11.45 [2019-03-28 12:46:19,087 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 21) no Hoare annotation was computed. 25.97/11.45 [2019-03-28 12:46:19,088 INFO L444 ceAbstractionStarter]: At program point L19-3(lines 19 21) the Hoare annotation is: (let ((.cse7 (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~i~0))) (.cse1 (select |#length| ULTIMATE.start_main_~arr~0.base))) (let ((.cse2 (<= .cse7 .cse1)) (.cse3 (<= 4 .cse7)) (.cse4 (= .cse1 (* 4 ULTIMATE.start_main_~length~0))) (.cse5 (= 1 (select |#valid| ULTIMATE.start_main_~arr~0.base))) (.cse6 (= ULTIMATE.start_main_~arr~0.offset 0))) (or (let ((.cse0 (* 4 ULTIMATE.start_main_~j~0))) (and (<= (+ ULTIMATE.start_main_~arr~0.offset .cse0 4) .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 4 (+ ULTIMATE.start_main_~arr~0.offset .cse0)))) (and .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_main_~j~0 0))))) 25.97/11.45 [2019-03-28 12:46:19,088 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 15) no Hoare annotation was computed. 25.97/11.45 [2019-03-28 12:46:19,088 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 13 15) no Hoare annotation was computed. 25.97/11.45 [2019-03-28 12:46:19,088 INFO L444 ceAbstractionStarter]: At program point L11-2(lines 11 17) the Hoare annotation is: (let ((.cse4 (select |#length| ULTIMATE.start_main_~arr~0.base))) (let ((.cse0 (= .cse4 (* 4 ULTIMATE.start_main_~length~0))) (.cse1 (= 1 (select |#valid| ULTIMATE.start_main_~arr~0.base))) (.cse2 (= ULTIMATE.start_main_~arr~0.offset 0))) (or (and (<= 1 ULTIMATE.start_main_~length~0) .cse0 .cse1 (= ULTIMATE.start_main_~i~0 0) .cse2) (let ((.cse3 (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~i~0)))) (and (<= .cse3 .cse4) (<= 4 .cse3) .cse0 .cse1 .cse2))))) 25.97/11.45 [2019-03-28 12:46:19,088 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 25.97/11.45 [2019-03-28 12:46:19,088 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 25.97/11.45 [2019-03-28 12:46:19,089 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 25.97/11.45 [2019-03-28 12:46:19,089 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 25.97/11.45 [2019-03-28 12:46:19,089 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 25.97/11.45 [2019-03-28 12:46:19,089 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 25.97/11.45 [2019-03-28 12:46:19,089 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 25.97/11.45 [2019-03-28 12:46:19,089 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 25.97/11.45 [2019-03-28 12:46:19,089 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. 25.97/11.45 [2019-03-28 12:46:19,090 INFO L448 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. 25.97/11.45 [2019-03-28 12:46:19,090 INFO L444 ceAbstractionStarter]: At program point L18-3(lines 18 22) the Hoare annotation is: (let ((.cse6 (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~i~0))) (.cse5 (select |#length| ULTIMATE.start_main_~arr~0.base))) (let ((.cse0 (<= .cse6 .cse5)) (.cse1 (<= 4 .cse6)) (.cse2 (= .cse5 (* 4 ULTIMATE.start_main_~length~0))) (.cse3 (= 1 (select |#valid| ULTIMATE.start_main_~arr~0.base))) (.cse4 (= ULTIMATE.start_main_~arr~0.offset 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_main_~j~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 4 (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~j~0))))))) 25.97/11.45 [2019-03-28 12:46:19,090 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 25.97/11.45 [2019-03-28 12:46:19,091 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. 25.97/11.45 [2019-03-28 12:46:19,091 INFO L448 ceAbstractionStarter]: For program point L8-2(line 8) no Hoare annotation was computed. 25.97/11.45 [2019-03-28 12:46:19,091 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 25.97/11.45 [2019-03-28 12:46:19,100 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:19,102 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:19,102 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:19,102 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:19,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:19,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:19,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:19,110 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:19,112 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:19,112 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:19,113 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:19,113 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:19,114 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:19,115 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:19,115 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:19,115 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:19,116 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:19,116 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:19,117 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:19,117 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:19,118 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:19,119 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:19,119 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:19,119 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:19,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:46:19 BasicIcfg 25.97/11.45 [2019-03-28 12:46:19,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 25.97/11.45 [2019-03-28 12:46:19,122 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 25.97/11.45 [2019-03-28 12:46:19,122 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 25.97/11.45 [2019-03-28 12:46:19,126 INFO L276 PluginConnector]: BuchiAutomizer initialized 25.97/11.45 [2019-03-28 12:46:19,127 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.97/11.45 [2019-03-28 12:46:19,127 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:46:16" (1/5) ... 25.97/11.45 [2019-03-28 12:46:19,128 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fe1eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:46:19, skipping insertion in model container 25.97/11.45 [2019-03-28 12:46:19,128 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.97/11.45 [2019-03-28 12:46:19,128 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:16" (2/5) ... 25.97/11.45 [2019-03-28 12:46:19,128 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fe1eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:46:19, skipping insertion in model container 25.97/11.45 [2019-03-28 12:46:19,129 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.97/11.45 [2019-03-28 12:46:19,129 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:17" (3/5) ... 25.97/11.45 [2019-03-28 12:46:19,129 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fe1eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:19, skipping insertion in model container 25.97/11.45 [2019-03-28 12:46:19,129 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.97/11.45 [2019-03-28 12:46:19,129 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:46:17" (4/5) ... 25.97/11.45 [2019-03-28 12:46:19,130 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fe1eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:19, skipping insertion in model container 25.97/11.45 [2019-03-28 12:46:19,130 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.97/11.45 [2019-03-28 12:46:19,130 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:46:19" (5/5) ... 25.97/11.45 [2019-03-28 12:46:19,131 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 25.97/11.45 [2019-03-28 12:46:19,153 INFO L133 ementStrategyFactory]: Using default assertion order modulation 25.97/11.45 [2019-03-28 12:46:19,153 INFO L374 BuchiCegarLoop]: Interprodecural is true 25.97/11.45 [2019-03-28 12:46:19,153 INFO L375 BuchiCegarLoop]: Hoare is true 25.97/11.45 [2019-03-28 12:46:19,153 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 25.97/11.45 [2019-03-28 12:46:19,154 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 25.97/11.45 [2019-03-28 12:46:19,154 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 25.97/11.45 [2019-03-28 12:46:19,154 INFO L379 BuchiCegarLoop]: Difference is false 25.97/11.45 [2019-03-28 12:46:19,154 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 25.97/11.45 [2019-03-28 12:46:19,154 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 25.97/11.45 [2019-03-28 12:46:19,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. 25.97/11.45 [2019-03-28 12:46:19,162 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 25.97/11.45 [2019-03-28 12:46:19,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.97/11.45 [2019-03-28 12:46:19,163 INFO L119 BuchiIsEmpty]: Starting construction of run 25.97/11.45 [2019-03-28 12:46:19,167 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 25.97/11.45 [2019-03-28 12:46:19,167 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 25.97/11.45 [2019-03-28 12:46:19,167 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 25.97/11.45 [2019-03-28 12:46:19,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. 25.97/11.45 [2019-03-28 12:46:19,169 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 25.97/11.45 [2019-03-28 12:46:19,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.97/11.45 [2019-03-28 12:46:19,169 INFO L119 BuchiIsEmpty]: Starting construction of run 25.97/11.45 [2019-03-28 12:46:19,170 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 25.97/11.45 [2019-03-28 12:46:19,170 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 25.97/11.45 [2019-03-28 12:46:19,175 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue [152] ULTIMATE.startENTRY-->L8: 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~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 12#L8true [107] L8-->L8-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 7#L8-2true [131] L8-2-->L10: Formula: (and (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (< |v_ULTIMATE.start_main_#t~malloc1.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_#length_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 15#L10true [135] L10-->L11-2: Formula: (and (< 0 v_ULTIMATE.start_main_~arr~0.offset_5) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_5} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 13#L11-2true 25.97/11.45 [2019-03-28 12:46:19,175 INFO L796 eck$LassoCheckResult]: Loop: 13#L11-2true [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 21#L13true [113] L13-->L13-2: Formula: (and (< v_ULTIMATE.start_main_~val~0_6 0) (= v_ULTIMATE.start_main_~val~0_5 0)) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_6} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~val~0] 17#L13-2true [155] L13-2-->L11-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~i~0_14))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14))) (and (= (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18) 1) (<= 0 .cse0) (= (+ v_ULTIMATE.start_main_~i~0_14 1) v_ULTIMATE.start_main_~i~0_13) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) .cse0 v_ULTIMATE.start_main_~val~0_10)))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 13#L11-2true 25.97/11.45 [2019-03-28 12:46:19,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:19,176 INFO L82 PathProgramCache]: Analyzing trace with hash 5558776, now seen corresponding path program 1 times 25.97/11.45 [2019-03-28 12:46:19,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:19,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:19,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:19,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:19,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.97/11.45 [2019-03-28 12:46:19,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.97/11.45 [2019-03-28 12:46:19,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.97/11.45 [2019-03-28 12:46:19,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.97/11.45 [2019-03-28 12:46:19,192 INFO L799 eck$LassoCheckResult]: stem already infeasible 25.97/11.45 [2019-03-28 12:46:19,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:19,193 INFO L82 PathProgramCache]: Analyzing trace with hash 119939, now seen corresponding path program 1 times 25.97/11.45 [2019-03-28 12:46:19,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:19,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:19,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:19,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:19,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:19,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.97/11.45 [2019-03-28 12:46:19,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.97/11.45 [2019-03-28 12:46:19,269 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. 25.97/11.45 [2019-03-28 12:46:19,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.97/11.45 [2019-03-28 12:46:19,303 INFO L93 Difference]: Finished difference Result 20 states and 34 transitions. 25.97/11.45 [2019-03-28 12:46:19,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.97/11.45 [2019-03-28 12:46:19,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 34 transitions. 25.97/11.45 [2019-03-28 12:46:19,308 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 25.97/11.45 [2019-03-28 12:46:19,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 12 states and 18 transitions. 25.97/11.45 [2019-03-28 12:46:19,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 25.97/11.45 [2019-03-28 12:46:19,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 25.97/11.45 [2019-03-28 12:46:19,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 18 transitions. 25.97/11.45 [2019-03-28 12:46:19,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.97/11.45 [2019-03-28 12:46:19,311 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. 25.97/11.45 [2019-03-28 12:46:19,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 18 transitions. 25.97/11.45 [2019-03-28 12:46:19,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. 25.97/11.45 [2019-03-28 12:46:19,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 25.97/11.45 [2019-03-28 12:46:19,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. 25.97/11.45 [2019-03-28 12:46:19,314 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. 25.97/11.45 [2019-03-28 12:46:19,314 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. 25.97/11.45 [2019-03-28 12:46:19,314 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 25.97/11.45 [2019-03-28 12:46:19,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 18 transitions. 25.97/11.45 [2019-03-28 12:46:19,314 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 25.97/11.45 [2019-03-28 12:46:19,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.97/11.45 [2019-03-28 12:46:19,315 INFO L119 BuchiIsEmpty]: Starting construction of run 25.97/11.45 [2019-03-28 12:46:19,315 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 25.97/11.45 [2019-03-28 12:46:19,315 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 25.97/11.45 [2019-03-28 12:46:19,316 INFO L794 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: 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~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 55#L8 [107] L8-->L8-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 57#L8-2 [131] L8-2-->L10: Formula: (and (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (< |v_ULTIMATE.start_main_#t~malloc1.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_#length_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 51#L10 [133] L10-->L11-2: Formula: (and (< v_ULTIMATE.start_main_~arr~0.base_5 0) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 52#L11-2 25.97/11.45 [2019-03-28 12:46:19,316 INFO L796 eck$LassoCheckResult]: Loop: 52#L11-2 [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 60#L13 [113] L13-->L13-2: Formula: (and (< v_ULTIMATE.start_main_~val~0_6 0) (= v_ULTIMATE.start_main_~val~0_5 0)) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_6} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~val~0] 56#L13-2 [155] L13-2-->L11-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~i~0_14))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14))) (and (= (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18) 1) (<= 0 .cse0) (= (+ v_ULTIMATE.start_main_~i~0_14 1) v_ULTIMATE.start_main_~i~0_13) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) .cse0 v_ULTIMATE.start_main_~val~0_10)))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 52#L11-2 25.97/11.45 [2019-03-28 12:46:19,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:19,316 INFO L82 PathProgramCache]: Analyzing trace with hash 5558774, now seen corresponding path program 1 times 25.97/11.45 [2019-03-28 12:46:19,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:19,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:19,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:19,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:19,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.97/11.45 [2019-03-28 12:46:19,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.97/11.45 [2019-03-28 12:46:19,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.97/11.45 [2019-03-28 12:46:19,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.97/11.45 [2019-03-28 12:46:19,332 INFO L799 eck$LassoCheckResult]: stem already infeasible 25.97/11.45 [2019-03-28 12:46:19,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:19,332 INFO L82 PathProgramCache]: Analyzing trace with hash 119939, now seen corresponding path program 2 times 25.97/11.45 [2019-03-28 12:46:19,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:19,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:19,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:19,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:19,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:19,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.97/11.45 [2019-03-28 12:46:19,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.97/11.45 [2019-03-28 12:46:19,401 INFO L87 Difference]: Start difference. First operand 12 states and 18 transitions. cyclomatic complexity: 8 Second operand 3 states. 25.97/11.45 [2019-03-28 12:46:19,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.97/11.45 [2019-03-28 12:46:19,476 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. 25.97/11.45 [2019-03-28 12:46:19,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.97/11.45 [2019-03-28 12:46:19,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. 25.97/11.45 [2019-03-28 12:46:19,477 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 25.97/11.45 [2019-03-28 12:46:19,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 30 transitions. 25.97/11.45 [2019-03-28 12:46:19,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 25.97/11.45 [2019-03-28 12:46:19,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 25.97/11.45 [2019-03-28 12:46:19,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. 25.97/11.45 [2019-03-28 12:46:19,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.97/11.45 [2019-03-28 12:46:19,479 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. 25.97/11.45 [2019-03-28 12:46:19,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. 25.97/11.45 [2019-03-28 12:46:19,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 13. 25.97/11.45 [2019-03-28 12:46:19,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 25.97/11.45 [2019-03-28 12:46:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. 25.97/11.45 [2019-03-28 12:46:19,481 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. 25.97/11.45 [2019-03-28 12:46:19,481 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. 25.97/11.45 [2019-03-28 12:46:19,481 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 25.97/11.45 [2019-03-28 12:46:19,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. 25.97/11.45 [2019-03-28 12:46:19,481 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 25.97/11.45 [2019-03-28 12:46:19,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.97/11.45 [2019-03-28 12:46:19,482 INFO L119 BuchiIsEmpty]: Starting construction of run 25.97/11.45 [2019-03-28 12:46:19,482 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 25.97/11.45 [2019-03-28 12:46:19,482 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 25.97/11.45 [2019-03-28 12:46:19,483 INFO L794 eck$LassoCheckResult]: Stem: 92#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: 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~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 93#L8 [107] L8-->L8-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 96#L8-2 [130] L8-2-->L10: Formula: (and (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (< |v_ULTIMATE.start_main_#t~malloc1.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_#length_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 97#L10 [133] L10-->L11-2: Formula: (and (< v_ULTIMATE.start_main_~arr~0.base_5 0) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 91#L11-2 25.97/11.45 [2019-03-28 12:46:19,483 INFO L796 eck$LassoCheckResult]: Loop: 91#L11-2 [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 100#L13 [113] L13-->L13-2: Formula: (and (< v_ULTIMATE.start_main_~val~0_6 0) (= v_ULTIMATE.start_main_~val~0_5 0)) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_6} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~val~0] 95#L13-2 [155] L13-2-->L11-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~i~0_14))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14))) (and (= (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18) 1) (<= 0 .cse0) (= (+ v_ULTIMATE.start_main_~i~0_14 1) v_ULTIMATE.start_main_~i~0_13) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) .cse0 v_ULTIMATE.start_main_~val~0_10)))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 91#L11-2 25.97/11.45 [2019-03-28 12:46:19,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:19,483 INFO L82 PathProgramCache]: Analyzing trace with hash 5558743, now seen corresponding path program 1 times 25.97/11.45 [2019-03-28 12:46:19,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:19,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:19,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:19,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:19,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:19,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:19,495 INFO L82 PathProgramCache]: Analyzing trace with hash 119939, now seen corresponding path program 3 times 25.97/11.45 [2019-03-28 12:46:19,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:19,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:19,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:19,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:19,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:19,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:19,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1903121683, now seen corresponding path program 1 times 25.97/11.45 [2019-03-28 12:46:19,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:19,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:19,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:19,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:19,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:19,672 INFO L216 LassoAnalysis]: Preferences: 25.97/11.45 [2019-03-28 12:46:19,673 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.97/11.45 [2019-03-28 12:46:19,673 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.97/11.45 [2019-03-28 12:46:19,673 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.97/11.45 [2019-03-28 12:46:19,673 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.97/11.45 [2019-03-28 12:46:19,673 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.97/11.45 [2019-03-28 12:46:19,674 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.97/11.45 [2019-03-28 12:46:19,674 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.97/11.45 [2019-03-28 12:46:19,674 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 25.97/11.45 [2019-03-28 12:46:19,674 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.97/11.45 [2019-03-28 12:46:19,674 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.97/11.45 [2019-03-28 12:46:19,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:19,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:19,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:19,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:19,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:19,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:19,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:19,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:19,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:19,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:19,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:19,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:19,982 INFO L300 LassoAnalysis]: Preprocessing complete. 25.97/11.45 [2019-03-28 12:46:19,987 INFO L497 LassoAnalysis]: Using template 'affine'. 25.97/11.45 [2019-03-28 12:46:19,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.45 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.45 Number of strict supporting invariants: 0 25.97/11.45 Number of non-strict supporting invariants: 1 25.97/11.45 Consider only non-deceasing supporting invariants: true 25.97/11.45 Simplify termination arguments: true 25.97/11.45 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.45 [2019-03-28 12:46:19,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.45 [2019-03-28 12:46:19,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.97/11.45 [2019-03-28 12:46:19,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.45 [2019-03-28 12:46:19,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.45 [2019-03-28 12:46:19,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.45 [2019-03-28 12:46:19,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.97/11.45 [2019-03-28 12:46:19,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.97/11.45 [2019-03-28 12:46:19,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.45 [2019-03-28 12:46:19,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.45 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.45 Number of strict supporting invariants: 0 25.97/11.45 Number of non-strict supporting invariants: 1 25.97/11.45 Consider only non-deceasing supporting invariants: true 25.97/11.45 Simplify termination arguments: true 25.97/11.45 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.45 [2019-03-28 12:46:19,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.45 [2019-03-28 12:46:19,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.97/11.45 [2019-03-28 12:46:19,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.45 [2019-03-28 12:46:19,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.45 [2019-03-28 12:46:19,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.45 [2019-03-28 12:46:19,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.97/11.45 [2019-03-28 12:46:19,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.97/11.45 [2019-03-28 12:46:19,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.45 [2019-03-28 12:46:19,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.45 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.45 Number of strict supporting invariants: 0 25.97/11.45 Number of non-strict supporting invariants: 1 25.97/11.45 Consider only non-deceasing supporting invariants: true 25.97/11.45 Simplify termination arguments: true 25.97/11.45 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.45 [2019-03-28 12:46:19,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.45 [2019-03-28 12:46:19,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.97/11.45 [2019-03-28 12:46:20,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.45 [2019-03-28 12:46:20,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.45 [2019-03-28 12:46:20,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.45 [2019-03-28 12:46:20,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.97/11.45 [2019-03-28 12:46:20,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.97/11.45 [2019-03-28 12:46:20,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.45 [2019-03-28 12:46:20,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.45 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.45 Number of strict supporting invariants: 0 25.97/11.45 Number of non-strict supporting invariants: 1 25.97/11.45 Consider only non-deceasing supporting invariants: true 25.97/11.45 Simplify termination arguments: true 25.97/11.45 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.45 [2019-03-28 12:46:20,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.45 [2019-03-28 12:46:20,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.45 [2019-03-28 12:46:20,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.45 [2019-03-28 12:46:20,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.45 [2019-03-28 12:46:20,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.97/11.45 [2019-03-28 12:46:20,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.97/11.45 [2019-03-28 12:46:20,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.45 [2019-03-28 12:46:20,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.45 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.45 Number of strict supporting invariants: 0 25.97/11.45 Number of non-strict supporting invariants: 1 25.97/11.45 Consider only non-deceasing supporting invariants: true 25.97/11.45 Simplify termination arguments: true 25.97/11.45 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.45 [2019-03-28 12:46:20,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.45 [2019-03-28 12:46:20,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.97/11.45 [2019-03-28 12:46:20,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.45 [2019-03-28 12:46:20,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.45 [2019-03-28 12:46:20,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.45 [2019-03-28 12:46:20,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.97/11.45 [2019-03-28 12:46:20,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.97/11.45 [2019-03-28 12:46:20,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.45 [2019-03-28 12:46:20,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.45 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.45 Number of strict supporting invariants: 0 25.97/11.45 Number of non-strict supporting invariants: 1 25.97/11.45 Consider only non-deceasing supporting invariants: true 25.97/11.45 Simplify termination arguments: true 25.97/11.45 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.45 [2019-03-28 12:46:20,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.45 [2019-03-28 12:46:20,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.45 [2019-03-28 12:46:20,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.45 [2019-03-28 12:46:20,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.45 [2019-03-28 12:46:20,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.97/11.45 [2019-03-28 12:46:20,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.97/11.45 [2019-03-28 12:46:20,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.45 [2019-03-28 12:46:20,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.45 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.45 Number of strict supporting invariants: 0 25.97/11.45 Number of non-strict supporting invariants: 1 25.97/11.45 Consider only non-deceasing supporting invariants: true 25.97/11.45 Simplify termination arguments: true 25.97/11.45 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.45 [2019-03-28 12:46:20,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.45 [2019-03-28 12:46:20,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.45 [2019-03-28 12:46:20,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.45 [2019-03-28 12:46:20,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.45 [2019-03-28 12:46:20,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.97/11.45 [2019-03-28 12:46:20,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.97/11.45 [2019-03-28 12:46:20,055 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.97/11.45 [2019-03-28 12:46:20,069 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 25.97/11.45 [2019-03-28 12:46:20,069 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. 25.97/11.45 [2019-03-28 12:46:20,072 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.97/11.45 [2019-03-28 12:46:20,074 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 25.97/11.45 [2019-03-28 12:46:20,074 INFO L518 LassoAnalysis]: Proved termination. 25.97/11.45 [2019-03-28 12:46:20,074 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.97/11.45 Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~i~0 25.97/11.45 Supporting invariants [] 25.97/11.45 [2019-03-28 12:46:20,092 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed 25.97/11.45 [2019-03-28 12:46:20,095 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.45 [2019-03-28 12:46:20,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.97/11.45 [2019-03-28 12:46:20,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core 25.97/11.45 [2019-03-28 12:46:20,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.97/11.45 [2019-03-28 12:46:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.97/11.45 [2019-03-28 12:46:20,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 25.97/11.45 [2019-03-28 12:46:20,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.97/11.45 [2019-03-28 12:46:20,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.97/11.45 [2019-03-28 12:46:20,134 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization 25.97/11.45 [2019-03-28 12:46:20,137 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 1 loop predicates 25.97/11.45 [2019-03-28 12:46:20,138 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. 25.97/11.45 [2019-03-28 12:46:20,181 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 19 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 30 states and 45 transitions. Complement of second has 4 states. 25.97/11.45 [2019-03-28 12:46:20,181 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.97/11.45 [2019-03-28 12:46:20,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 25.97/11.45 [2019-03-28 12:46:20,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. 25.97/11.45 [2019-03-28 12:46:20,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 4 letters. Loop has 3 letters. 25.97/11.45 [2019-03-28 12:46:20,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.97/11.45 [2019-03-28 12:46:20,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 7 letters. Loop has 3 letters. 25.97/11.45 [2019-03-28 12:46:20,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.97/11.45 [2019-03-28 12:46:20,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 4 letters. Loop has 6 letters. 25.97/11.45 [2019-03-28 12:46:20,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.97/11.45 [2019-03-28 12:46:20,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 45 transitions. 25.97/11.45 [2019-03-28 12:46:20,192 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 25.97/11.45 [2019-03-28 12:46:20,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 23 states and 33 transitions. 25.97/11.45 [2019-03-28 12:46:20,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 25.97/11.45 [2019-03-28 12:46:20,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 25.97/11.45 [2019-03-28 12:46:20,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 33 transitions. 25.97/11.45 [2019-03-28 12:46:20,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.97/11.45 [2019-03-28 12:46:20,193 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. 25.97/11.45 [2019-03-28 12:46:20,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 33 transitions. 25.97/11.45 [2019-03-28 12:46:20,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. 25.97/11.45 [2019-03-28 12:46:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 25.97/11.45 [2019-03-28 12:46:20,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. 25.97/11.45 [2019-03-28 12:46:20,195 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. 25.97/11.45 [2019-03-28 12:46:20,195 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. 25.97/11.45 [2019-03-28 12:46:20,195 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 25.97/11.45 [2019-03-28 12:46:20,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 26 transitions. 25.97/11.45 [2019-03-28 12:46:20,196 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 25.97/11.45 [2019-03-28 12:46:20,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.97/11.45 [2019-03-28 12:46:20,196 INFO L119 BuchiIsEmpty]: Starting construction of run 25.97/11.45 [2019-03-28 12:46:20,196 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 25.97/11.45 [2019-03-28 12:46:20,196 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 25.97/11.45 [2019-03-28 12:46:20,197 INFO L794 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: 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~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 189#L8 [107] L8-->L8-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 193#L8-2 [130] L8-2-->L10: Formula: (and (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (< |v_ULTIMATE.start_main_#t~malloc1.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_#length_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 194#L10 [132] L10-->L11-2: Formula: (and (> v_ULTIMATE.start_main_~arr~0.base_5 0) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 186#L11-2 25.97/11.45 [2019-03-28 12:46:20,197 INFO L796 eck$LassoCheckResult]: Loop: 186#L11-2 [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 197#L13 [113] L13-->L13-2: Formula: (and (< v_ULTIMATE.start_main_~val~0_6 0) (= v_ULTIMATE.start_main_~val~0_5 0)) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_6} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~val~0] 190#L13-2 [155] L13-2-->L11-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~i~0_14))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14))) (and (= (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18) 1) (<= 0 .cse0) (= (+ v_ULTIMATE.start_main_~i~0_14 1) v_ULTIMATE.start_main_~i~0_13) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) .cse0 v_ULTIMATE.start_main_~val~0_10)))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 186#L11-2 25.97/11.45 [2019-03-28 12:46:20,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:20,198 INFO L82 PathProgramCache]: Analyzing trace with hash 5558742, now seen corresponding path program 1 times 25.97/11.45 [2019-03-28 12:46:20,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:20,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:20,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:20,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:20,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.97/11.45 [2019-03-28 12:46:20,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.97/11.45 [2019-03-28 12:46:20,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.97/11.45 [2019-03-28 12:46:20,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.97/11.45 [2019-03-28 12:46:20,211 INFO L799 eck$LassoCheckResult]: stem already infeasible 25.97/11.45 [2019-03-28 12:46:20,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:20,212 INFO L82 PathProgramCache]: Analyzing trace with hash 119939, now seen corresponding path program 4 times 25.97/11.45 [2019-03-28 12:46:20,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:20,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:20,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:20,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:20,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:20,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.97/11.45 [2019-03-28 12:46:20,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.97/11.45 [2019-03-28 12:46:20,265 INFO L87 Difference]: Start difference. First operand 17 states and 26 transitions. cyclomatic complexity: 12 Second operand 3 states. 25.97/11.45 [2019-03-28 12:46:20,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.97/11.45 [2019-03-28 12:46:20,287 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. 25.97/11.45 [2019-03-28 12:46:20,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.97/11.45 [2019-03-28 12:46:20,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. 25.97/11.45 [2019-03-28 12:46:20,291 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 25.97/11.45 [2019-03-28 12:46:20,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 31 transitions. 25.97/11.45 [2019-03-28 12:46:20,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 25.97/11.45 [2019-03-28 12:46:20,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 25.97/11.45 [2019-03-28 12:46:20,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. 25.97/11.45 [2019-03-28 12:46:20,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.97/11.45 [2019-03-28 12:46:20,292 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. 25.97/11.45 [2019-03-28 12:46:20,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. 25.97/11.45 [2019-03-28 12:46:20,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. 25.97/11.45 [2019-03-28 12:46:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 25.97/11.45 [2019-03-28 12:46:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. 25.97/11.45 [2019-03-28 12:46:20,294 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. 25.97/11.45 [2019-03-28 12:46:20,294 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. 25.97/11.45 [2019-03-28 12:46:20,294 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 25.97/11.45 [2019-03-28 12:46:20,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. 25.97/11.45 [2019-03-28 12:46:20,295 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 25.97/11.45 [2019-03-28 12:46:20,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.97/11.45 [2019-03-28 12:46:20,295 INFO L119 BuchiIsEmpty]: Starting construction of run 25.97/11.45 [2019-03-28 12:46:20,295 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 25.97/11.45 [2019-03-28 12:46:20,295 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 25.97/11.45 [2019-03-28 12:46:20,296 INFO L794 eck$LassoCheckResult]: Stem: 232#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: 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~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 233#L8 [107] L8-->L8-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 239#L8-2 [131] L8-2-->L10: Formula: (and (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (< |v_ULTIMATE.start_main_#t~malloc1.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_#length_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 240#L10 [132] L10-->L11-2: Formula: (and (> v_ULTIMATE.start_main_~arr~0.base_5 0) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 236#L11-2 25.97/11.45 [2019-03-28 12:46:20,296 INFO L796 eck$LassoCheckResult]: Loop: 236#L11-2 [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 243#L13 [113] L13-->L13-2: Formula: (and (< v_ULTIMATE.start_main_~val~0_6 0) (= v_ULTIMATE.start_main_~val~0_5 0)) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_6} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~val~0] 235#L13-2 [155] L13-2-->L11-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~i~0_14))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14))) (and (= (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18) 1) (<= 0 .cse0) (= (+ v_ULTIMATE.start_main_~i~0_14 1) v_ULTIMATE.start_main_~i~0_13) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) .cse0 v_ULTIMATE.start_main_~val~0_10)))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 236#L11-2 25.97/11.45 [2019-03-28 12:46:20,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:20,296 INFO L82 PathProgramCache]: Analyzing trace with hash 5558773, now seen corresponding path program 1 times 25.97/11.45 [2019-03-28 12:46:20,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:20,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:20,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:20,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:20,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:20,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:20,308 INFO L82 PathProgramCache]: Analyzing trace with hash 119939, now seen corresponding path program 5 times 25.97/11.45 [2019-03-28 12:46:20,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:20,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:20,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:20,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:20,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:20,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:20,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1902227953, now seen corresponding path program 1 times 25.97/11.45 [2019-03-28 12:46:20,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:20,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:20,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:20,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:20,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:20,488 INFO L216 LassoAnalysis]: Preferences: 25.97/11.45 [2019-03-28 12:46:20,488 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.97/11.45 [2019-03-28 12:46:20,488 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.97/11.45 [2019-03-28 12:46:20,488 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.97/11.45 [2019-03-28 12:46:20,488 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.97/11.45 [2019-03-28 12:46:20,488 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.97/11.45 [2019-03-28 12:46:20,488 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.97/11.45 [2019-03-28 12:46:20,489 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.97/11.45 [2019-03-28 12:46:20,489 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 25.97/11.45 [2019-03-28 12:46:20,489 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.97/11.45 [2019-03-28 12:46:20,489 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.97/11.45 [2019-03-28 12:46:20,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:20,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:20,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:20,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:20,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:20,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:20,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:20,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:20,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:20,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:20,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:20,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:20,773 INFO L300 LassoAnalysis]: Preprocessing complete. 25.97/11.45 [2019-03-28 12:46:20,774 INFO L497 LassoAnalysis]: Using template 'affine'. 25.97/11.45 [2019-03-28 12:46:20,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.45 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.45 Number of strict supporting invariants: 0 25.97/11.45 Number of non-strict supporting invariants: 1 25.97/11.45 Consider only non-deceasing supporting invariants: true 25.97/11.45 Simplify termination arguments: true 25.97/11.45 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.45 [2019-03-28 12:46:20,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.45 [2019-03-28 12:46:20,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.45 [2019-03-28 12:46:20,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.45 [2019-03-28 12:46:20,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.45 [2019-03-28 12:46:20,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.97/11.45 [2019-03-28 12:46:20,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.97/11.45 [2019-03-28 12:46:20,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.45 [2019-03-28 12:46:20,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.45 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.45 Number of strict supporting invariants: 0 25.97/11.45 Number of non-strict supporting invariants: 1 25.97/11.45 Consider only non-deceasing supporting invariants: true 25.97/11.45 Simplify termination arguments: true 25.97/11.45 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.45 [2019-03-28 12:46:20,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.45 [2019-03-28 12:46:20,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.97/11.45 [2019-03-28 12:46:20,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.45 [2019-03-28 12:46:20,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.45 [2019-03-28 12:46:20,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.45 [2019-03-28 12:46:20,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.97/11.45 [2019-03-28 12:46:20,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.97/11.45 [2019-03-28 12:46:20,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.45 [2019-03-28 12:46:20,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.45 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.45 Number of strict supporting invariants: 0 25.97/11.45 Number of non-strict supporting invariants: 1 25.97/11.45 Consider only non-deceasing supporting invariants: true 25.97/11.45 Simplify termination arguments: true 25.97/11.45 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.45 [2019-03-28 12:46:20,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.45 [2019-03-28 12:46:20,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.97/11.45 [2019-03-28 12:46:20,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.45 [2019-03-28 12:46:20,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.45 [2019-03-28 12:46:20,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.45 [2019-03-28 12:46:20,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.97/11.45 [2019-03-28 12:46:20,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.97/11.45 [2019-03-28 12:46:20,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.45 [2019-03-28 12:46:20,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.45 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.45 Number of strict supporting invariants: 0 25.97/11.45 Number of non-strict supporting invariants: 1 25.97/11.45 Consider only non-deceasing supporting invariants: true 25.97/11.45 Simplify termination arguments: true 25.97/11.45 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.45 [2019-03-28 12:46:20,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.45 [2019-03-28 12:46:20,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.97/11.45 [2019-03-28 12:46:20,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.45 [2019-03-28 12:46:20,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.45 [2019-03-28 12:46:20,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.45 [2019-03-28 12:46:20,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.97/11.45 [2019-03-28 12:46:20,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.97/11.45 [2019-03-28 12:46:20,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.45 [2019-03-28 12:46:20,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.45 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.45 Number of strict supporting invariants: 0 25.97/11.45 Number of non-strict supporting invariants: 1 25.97/11.45 Consider only non-deceasing supporting invariants: true 25.97/11.45 Simplify termination arguments: true 25.97/11.45 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.45 [2019-03-28 12:46:20,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.45 [2019-03-28 12:46:20,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.45 [2019-03-28 12:46:20,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.45 [2019-03-28 12:46:20,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.45 [2019-03-28 12:46:20,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.97/11.45 [2019-03-28 12:46:20,790 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.97/11.45 [2019-03-28 12:46:20,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.45 [2019-03-28 12:46:20,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.45 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.45 Number of strict supporting invariants: 0 25.97/11.45 Number of non-strict supporting invariants: 1 25.97/11.45 Consider only non-deceasing supporting invariants: true 25.97/11.45 Simplify termination arguments: true 25.97/11.45 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.45 [2019-03-28 12:46:20,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.45 [2019-03-28 12:46:20,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.45 [2019-03-28 12:46:20,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.45 [2019-03-28 12:46:20,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.45 [2019-03-28 12:46:20,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.97/11.45 [2019-03-28 12:46:20,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.97/11.45 [2019-03-28 12:46:20,816 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.97/11.45 [2019-03-28 12:46:20,836 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 25.97/11.45 [2019-03-28 12:46:20,836 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. 25.97/11.45 [2019-03-28 12:46:20,837 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.97/11.45 [2019-03-28 12:46:20,838 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 25.97/11.45 [2019-03-28 12:46:20,838 INFO L518 LassoAnalysis]: Proved termination. 25.97/11.45 [2019-03-28 12:46:20,838 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.97/11.45 Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~arr~0.offset) = -4*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~arr~0.offset + 1 25.97/11.45 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 + 4 >= 0] 25.97/11.45 [2019-03-28 12:46:20,848 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed 25.97/11.45 [2019-03-28 12:46:20,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.97/11.45 [2019-03-28 12:46:20,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core 25.97/11.45 [2019-03-28 12:46:20,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.97/11.45 [2019-03-28 12:46:20,945 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 25.97/11.45 [2019-03-28 12:46:20,946 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 25.97/11.45 [2019-03-28 12:46:20,953 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 25.97/11.45 [2019-03-28 12:46:20,954 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 25.97/11.45 [2019-03-28 12:46:20,954 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 25.97/11.45 [2019-03-28 12:46:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.97/11.45 [2019-03-28 12:46:20,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core 25.97/11.45 [2019-03-28 12:46:20,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.97/11.45 [2019-03-28 12:46:20,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.97/11.45 [2019-03-28 12:46:21,032 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 25.97/11.45 [2019-03-28 12:46:21,033 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates 25.97/11.45 [2019-03-28 12:46:21,033 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 25 transitions. cyclomatic complexity: 11 Second operand 5 states. 25.97/11.45 [2019-03-28 12:46:21,214 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 25 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 62 states and 92 transitions. Complement of second has 9 states. 25.97/11.45 [2019-03-28 12:46:21,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states 25.97/11.45 [2019-03-28 12:46:21,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 25.97/11.45 [2019-03-28 12:46:21,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. 25.97/11.45 [2019-03-28 12:46:21,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 4 letters. Loop has 3 letters. 25.97/11.45 [2019-03-28 12:46:21,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.97/11.45 [2019-03-28 12:46:21,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 7 letters. Loop has 3 letters. 25.97/11.45 [2019-03-28 12:46:21,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.97/11.45 [2019-03-28 12:46:21,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 4 letters. Loop has 6 letters. 25.97/11.45 [2019-03-28 12:46:21,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.97/11.45 [2019-03-28 12:46:21,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 92 transitions. 25.97/11.45 [2019-03-28 12:46:21,221 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 25.97/11.45 [2019-03-28 12:46:21,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 47 states and 67 transitions. 25.97/11.45 [2019-03-28 12:46:21,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 25.97/11.45 [2019-03-28 12:46:21,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 25.97/11.45 [2019-03-28 12:46:21,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 67 transitions. 25.97/11.45 [2019-03-28 12:46:21,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.97/11.45 [2019-03-28 12:46:21,223 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 67 transitions. 25.97/11.45 [2019-03-28 12:46:21,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 67 transitions. 25.97/11.45 [2019-03-28 12:46:21,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 19. 25.97/11.45 [2019-03-28 12:46:21,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 25.97/11.45 [2019-03-28 12:46:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. 25.97/11.45 [2019-03-28 12:46:21,225 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. 25.97/11.45 [2019-03-28 12:46:21,225 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. 25.97/11.45 [2019-03-28 12:46:21,225 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 25.97/11.45 [2019-03-28 12:46:21,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. 25.97/11.45 [2019-03-28 12:46:21,226 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 25.97/11.45 [2019-03-28 12:46:21,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.97/11.45 [2019-03-28 12:46:21,226 INFO L119 BuchiIsEmpty]: Starting construction of run 25.97/11.45 [2019-03-28 12:46:21,227 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 25.97/11.45 [2019-03-28 12:46:21,227 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 25.97/11.45 [2019-03-28 12:46:21,227 INFO L794 eck$LassoCheckResult]: Stem: 390#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: 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~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 391#L8 [115] L8-->L8-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 402#L8-2 [131] L8-2-->L10: Formula: (and (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (< |v_ULTIMATE.start_main_#t~malloc1.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_#length_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 403#L10 [132] L10-->L11-2: Formula: (and (> v_ULTIMATE.start_main_~arr~0.base_5 0) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 393#L11-2 25.97/11.45 [2019-03-28 12:46:21,227 INFO L796 eck$LassoCheckResult]: Loop: 393#L11-2 [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 400#L13 [113] L13-->L13-2: Formula: (and (< v_ULTIMATE.start_main_~val~0_6 0) (= v_ULTIMATE.start_main_~val~0_5 0)) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_6} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~val~0] 392#L13-2 [155] L13-2-->L11-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~i~0_14))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14))) (and (= (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18) 1) (<= 0 .cse0) (= (+ v_ULTIMATE.start_main_~i~0_14 1) v_ULTIMATE.start_main_~i~0_13) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) .cse0 v_ULTIMATE.start_main_~val~0_10)))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 393#L11-2 25.97/11.45 [2019-03-28 12:46:21,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:21,228 INFO L82 PathProgramCache]: Analyzing trace with hash 5566461, now seen corresponding path program 1 times 25.97/11.45 [2019-03-28 12:46:21,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:21,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:21,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:21,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:21,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:21,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:21,238 INFO L82 PathProgramCache]: Analyzing trace with hash 119939, now seen corresponding path program 6 times 25.97/11.45 [2019-03-28 12:46:21,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:21,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:21,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:21,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:21,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:21,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:21,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1673194745, now seen corresponding path program 1 times 25.97/11.45 [2019-03-28 12:46:21,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:21,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:21,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:21,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:21,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:21,381 INFO L216 LassoAnalysis]: Preferences: 25.97/11.45 [2019-03-28 12:46:21,381 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.97/11.45 [2019-03-28 12:46:21,381 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.97/11.45 [2019-03-28 12:46:21,382 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.97/11.45 [2019-03-28 12:46:21,382 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.97/11.45 [2019-03-28 12:46:21,382 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.97/11.45 [2019-03-28 12:46:21,382 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.97/11.45 [2019-03-28 12:46:21,382 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.97/11.45 [2019-03-28 12:46:21,382 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso 25.97/11.45 [2019-03-28 12:46:21,382 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.97/11.45 [2019-03-28 12:46:21,382 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.97/11.45 [2019-03-28 12:46:21,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.97/11.45 [2019-03-28 12:46:21,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:21,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:21,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:21,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:21,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:21,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:21,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:21,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:21,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:21,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:21,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:21,669 INFO L300 LassoAnalysis]: Preprocessing complete. 25.97/11.45 [2019-03-28 12:46:21,669 INFO L497 LassoAnalysis]: Using template 'affine'. 25.97/11.45 [2019-03-28 12:46:21,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.45 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.45 Number of strict supporting invariants: 0 25.97/11.45 Number of non-strict supporting invariants: 1 25.97/11.45 Consider only non-deceasing supporting invariants: true 25.97/11.45 Simplify termination arguments: true 25.97/11.45 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.45 [2019-03-28 12:46:21,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.45 [2019-03-28 12:46:21,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.45 [2019-03-28 12:46:21,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.45 [2019-03-28 12:46:21,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.45 [2019-03-28 12:46:21,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.97/11.45 [2019-03-28 12:46:21,673 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.97/11.45 [2019-03-28 12:46:21,689 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.97/11.45 [2019-03-28 12:46:21,704 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 25.97/11.45 [2019-03-28 12:46:21,705 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. 25.97/11.45 [2019-03-28 12:46:21,705 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.97/11.45 [2019-03-28 12:46:21,706 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 25.97/11.45 [2019-03-28 12:46:21,706 INFO L518 LassoAnalysis]: Proved termination. 25.97/11.45 [2019-03-28 12:46:21,706 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.97/11.45 Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 25.97/11.45 Supporting invariants [] 25.97/11.45 [2019-03-28 12:46:21,718 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed 25.97/11.45 [2019-03-28 12:46:21,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.97/11.45 [2019-03-28 12:46:21,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core 25.97/11.45 [2019-03-28 12:46:21,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.97/11.45 [2019-03-28 12:46:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.97/11.45 [2019-03-28 12:46:21,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 25.97/11.45 [2019-03-28 12:46:21,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.97/11.45 [2019-03-28 12:46:21,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.97/11.45 [2019-03-28 12:46:21,782 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 25.97/11.45 [2019-03-28 12:46:21,783 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 25.97/11.45 [2019-03-28 12:46:21,783 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 19 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. 25.97/11.45 [2019-03-28 12:46:21,815 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 19 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 39 states and 62 transitions. Complement of second has 6 states. 25.97/11.45 [2019-03-28 12:46:21,815 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.97/11.45 [2019-03-28 12:46:21,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 25.97/11.45 [2019-03-28 12:46:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. 25.97/11.45 [2019-03-28 12:46:21,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 3 letters. 25.97/11.45 [2019-03-28 12:46:21,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.97/11.45 [2019-03-28 12:46:21,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 7 letters. Loop has 3 letters. 25.97/11.45 [2019-03-28 12:46:21,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.97/11.45 [2019-03-28 12:46:21,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 6 letters. 25.97/11.45 [2019-03-28 12:46:21,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.97/11.45 [2019-03-28 12:46:21,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 62 transitions. 25.97/11.45 [2019-03-28 12:46:21,821 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 25.97/11.45 [2019-03-28 12:46:21,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 30 states and 44 transitions. 25.97/11.45 [2019-03-28 12:46:21,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 25.97/11.45 [2019-03-28 12:46:21,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 25.97/11.45 [2019-03-28 12:46:21,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 44 transitions. 25.97/11.45 [2019-03-28 12:46:21,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.97/11.45 [2019-03-28 12:46:21,822 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 44 transitions. 25.97/11.45 [2019-03-28 12:46:21,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 44 transitions. 25.97/11.45 [2019-03-28 12:46:21,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 14. 25.97/11.45 [2019-03-28 12:46:21,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 25.97/11.45 [2019-03-28 12:46:21,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. 25.97/11.45 [2019-03-28 12:46:21,824 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. 25.97/11.45 [2019-03-28 12:46:21,824 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. 25.97/11.45 [2019-03-28 12:46:21,824 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 25.97/11.45 [2019-03-28 12:46:21,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. 25.97/11.45 [2019-03-28 12:46:21,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 25.97/11.45 [2019-03-28 12:46:21,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.97/11.45 [2019-03-28 12:46:21,825 INFO L119 BuchiIsEmpty]: Starting construction of run 25.97/11.45 [2019-03-28 12:46:21,825 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 25.97/11.45 [2019-03-28 12:46:21,826 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 25.97/11.45 [2019-03-28 12:46:21,826 INFO L794 eck$LassoCheckResult]: Stem: 504#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: 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~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 505#L8 [107] L8-->L8-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 509#L8-2 [130] L8-2-->L10: Formula: (and (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (< |v_ULTIMATE.start_main_#t~malloc1.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_#length_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 502#L10 [133] L10-->L11-2: Formula: (and (< v_ULTIMATE.start_main_~arr~0.base_5 0) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 503#L11-2 [154] L11-2-->L18-3: Formula: (and (<= v_ULTIMATE.start_main_~length~0_13 v_ULTIMATE.start_main_~i~0_12) (= 0 v_ULTIMATE.start_main_~j~0_16)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_13} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 500#L18-3 25.97/11.45 [2019-03-28 12:46:21,826 INFO L796 eck$LassoCheckResult]: Loop: 500#L18-3 [79] L18-3-->L19-3: Formula: (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~length~0_11) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[] 501#L19-3 [101] L19-3-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~j~0_10))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_8))) (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~arr~0.base_9)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~arr~0.base_9) .cse0)) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_8 4) (select |v_#length_6| v_ULTIMATE.start_main_~arr~0.base_9)) (<= 0 .cse0)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 506#L19-1 [157] L19-1-->L18-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_19 1) v_ULTIMATE.start_main_~j~0_18) (<= |v_ULTIMATE.start_main_#t~mem5_9| 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_9|} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_8|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~post4] 500#L18-3 25.97/11.45 [2019-03-28 12:46:21,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:21,827 INFO L82 PathProgramCache]: Analyzing trace with hash 172321187, now seen corresponding path program 1 times 25.97/11.45 [2019-03-28 12:46:21,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:21,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:21,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:21,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:21,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.97/11.45 [2019-03-28 12:46:21,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.97/11.45 [2019-03-28 12:46:21,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.97/11.45 [2019-03-28 12:46:21,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.97/11.45 [2019-03-28 12:46:21,846 INFO L799 eck$LassoCheckResult]: stem already infeasible 25.97/11.45 [2019-03-28 12:46:21,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:21,847 INFO L82 PathProgramCache]: Analyzing trace with hash 108998, now seen corresponding path program 1 times 25.97/11.45 [2019-03-28 12:46:21,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:21,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:21,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:21,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:21,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:21,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 25.97/11.45 [2019-03-28 12:46:21,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 25.97/11.45 [2019-03-28 12:46:21,882 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 4 states. 25.97/11.45 [2019-03-28 12:46:21,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.97/11.45 [2019-03-28 12:46:21,910 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. 25.97/11.45 [2019-03-28 12:46:21,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 25.97/11.45 [2019-03-28 12:46:21,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. 25.97/11.45 [2019-03-28 12:46:21,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 25.97/11.45 [2019-03-28 12:46:21,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. 25.97/11.45 [2019-03-28 12:46:21,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 25.97/11.45 [2019-03-28 12:46:21,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 25.97/11.45 [2019-03-28 12:46:21,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. 25.97/11.45 [2019-03-28 12:46:21,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.97/11.45 [2019-03-28 12:46:21,914 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. 25.97/11.45 [2019-03-28 12:46:21,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. 25.97/11.45 [2019-03-28 12:46:21,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. 25.97/11.45 [2019-03-28 12:46:21,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 25.97/11.45 [2019-03-28 12:46:21,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. 25.97/11.45 [2019-03-28 12:46:21,916 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. 25.97/11.45 [2019-03-28 12:46:21,916 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. 25.97/11.45 [2019-03-28 12:46:21,916 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 25.97/11.45 [2019-03-28 12:46:21,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. 25.97/11.45 [2019-03-28 12:46:21,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 25.97/11.45 [2019-03-28 12:46:21,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.97/11.45 [2019-03-28 12:46:21,917 INFO L119 BuchiIsEmpty]: Starting construction of run 25.97/11.45 [2019-03-28 12:46:21,917 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 25.97/11.45 [2019-03-28 12:46:21,918 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 25.97/11.45 [2019-03-28 12:46:21,918 INFO L794 eck$LassoCheckResult]: Stem: 541#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: 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~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 542#L8 [107] L8-->L8-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 546#L8-2 [130] L8-2-->L10: Formula: (and (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (< |v_ULTIMATE.start_main_#t~malloc1.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_#length_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 539#L10 [133] L10-->L11-2: Formula: (and (< v_ULTIMATE.start_main_~arr~0.base_5 0) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 540#L11-2 [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 550#L13 [119] L13-->L13-2: Formula: (>= v_ULTIMATE.start_main_~val~0_7 0) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_7} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_7} AuxVars[] AssignedVars[] 544#L13-2 [155] L13-2-->L11-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~i~0_14))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14))) (and (= (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18) 1) (<= 0 .cse0) (= (+ v_ULTIMATE.start_main_~i~0_14 1) v_ULTIMATE.start_main_~i~0_13) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) .cse0 v_ULTIMATE.start_main_~val~0_10)))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 545#L11-2 [154] L11-2-->L18-3: Formula: (and (<= v_ULTIMATE.start_main_~length~0_13 v_ULTIMATE.start_main_~i~0_12) (= 0 v_ULTIMATE.start_main_~j~0_16)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_13} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 537#L18-3 25.97/11.45 [2019-03-28 12:46:21,918 INFO L796 eck$LassoCheckResult]: Loop: 537#L18-3 [79] L18-3-->L19-3: Formula: (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~length~0_11) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[] 538#L19-3 [101] L19-3-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~j~0_10))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_8))) (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~arr~0.base_9)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~arr~0.base_9) .cse0)) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_8 4) (select |v_#length_6| v_ULTIMATE.start_main_~arr~0.base_9)) (<= 0 .cse0)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 543#L19-1 [157] L19-1-->L18-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_19 1) v_ULTIMATE.start_main_~j~0_18) (<= |v_ULTIMATE.start_main_#t~mem5_9| 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_9|} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_8|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~post4] 537#L18-3 25.97/11.45 [2019-03-28 12:46:21,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:21,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1132775891, now seen corresponding path program 1 times 25.97/11.45 [2019-03-28 12:46:21,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:21,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:21,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:21,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:21,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:21,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:21,931 INFO L82 PathProgramCache]: Analyzing trace with hash 108998, now seen corresponding path program 2 times 25.97/11.45 [2019-03-28 12:46:21,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:21,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:21,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:21,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:21,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:21,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:21,937 INFO L82 PathProgramCache]: Analyzing trace with hash 968603316, now seen corresponding path program 1 times 25.97/11.45 [2019-03-28 12:46:21,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.45 [2019-03-28 12:46:21,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.45 [2019-03-28 12:46:21,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:21,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:21,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.45 [2019-03-28 12:46:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.45 [2019-03-28 12:46:22,108 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 25.97/11.45 [2019-03-28 12:46:22,158 INFO L216 LassoAnalysis]: Preferences: 25.97/11.45 [2019-03-28 12:46:22,159 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.97/11.45 [2019-03-28 12:46:22,159 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.97/11.45 [2019-03-28 12:46:22,159 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.97/11.45 [2019-03-28 12:46:22,159 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.97/11.45 [2019-03-28 12:46:22,159 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.97/11.45 [2019-03-28 12:46:22,159 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.97/11.45 [2019-03-28 12:46:22,159 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.97/11.45 [2019-03-28 12:46:22,159 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Lasso 25.97/11.45 [2019-03-28 12:46:22,160 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.97/11.45 [2019-03-28 12:46:22,160 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.97/11.45 [2019-03-28 12:46:22,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:22,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:22,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:22,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:22,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:22,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:22,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:22,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:22,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:22,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:22,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.45 [2019-03-28 12:46:22,460 INFO L300 LassoAnalysis]: Preprocessing complete. 25.97/11.45 [2019-03-28 12:46:22,460 INFO L497 LassoAnalysis]: Using template 'affine'. 25.97/11.45 [2019-03-28 12:46:22,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.45 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.45 Number of strict supporting invariants: 0 25.97/11.45 Number of non-strict supporting invariants: 1 25.97/11.45 Consider only non-deceasing supporting invariants: true 25.97/11.45 Simplify termination arguments: true 25.97/11.45 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.45 [2019-03-28 12:46:22,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.45 [2019-03-28 12:46:22,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.97/11.45 [2019-03-28 12:46:22,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.45 [2019-03-28 12:46:22,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.45 [2019-03-28 12:46:22,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.45 [2019-03-28 12:46:22,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.97/11.45 [2019-03-28 12:46:22,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.97/11.45 [2019-03-28 12:46:22,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.45 [2019-03-28 12:46:22,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.45 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.45 Number of strict supporting invariants: 0 25.97/11.45 Number of non-strict supporting invariants: 1 25.97/11.45 Consider only non-deceasing supporting invariants: true 25.97/11.45 Simplify termination arguments: true 25.97/11.45 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.45 [2019-03-28 12:46:22,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.45 [2019-03-28 12:46:22,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.97/11.45 [2019-03-28 12:46:22,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.45 [2019-03-28 12:46:22,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.45 [2019-03-28 12:46:22,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.45 [2019-03-28 12:46:22,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.97/11.45 [2019-03-28 12:46:22,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.97/11.45 [2019-03-28 12:46:22,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.45 [2019-03-28 12:46:22,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.45 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.45 Number of strict supporting invariants: 0 25.97/11.45 Number of non-strict supporting invariants: 1 25.97/11.45 Consider only non-deceasing supporting invariants: true 25.97/11.45 Simplify termination arguments: true 25.97/11.45 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.45 [2019-03-28 12:46:22,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.45 [2019-03-28 12:46:22,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.45 [2019-03-28 12:46:22,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.45 [2019-03-28 12:46:22,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.45 [2019-03-28 12:46:22,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.97/11.45 [2019-03-28 12:46:22,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.97/11.45 [2019-03-28 12:46:22,479 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.97/11.45 [2019-03-28 12:46:22,501 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 25.97/11.45 [2019-03-28 12:46:22,502 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. 25.97/11.45 [2019-03-28 12:46:22,502 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.97/11.45 [2019-03-28 12:46:22,504 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 25.97/11.45 [2019-03-28 12:46:22,504 INFO L518 LassoAnalysis]: Proved termination. 25.97/11.45 [2019-03-28 12:46:22,504 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.97/11.45 Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 25.97/11.45 Supporting invariants [] 25.97/11.45 [2019-03-28 12:46:22,510 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed 25.97/11.45 [2019-03-28 12:46:22,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.45 [2019-03-28 12:46:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.97/11.45 [2019-03-28 12:46:22,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core 25.97/11.45 [2019-03-28 12:46:22,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.97/11.45 [2019-03-28 12:46:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.97/11.45 [2019-03-28 12:46:22,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core 25.97/11.46 [2019-03-28 12:46:22,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.97/11.46 [2019-03-28 12:46:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.97/11.46 [2019-03-28 12:46:22,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.97/11.46 [2019-03-28 12:46:22,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core 25.97/11.46 [2019-03-28 12:46:22,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.97/11.46 [2019-03-28 12:46:22,598 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 25.97/11.46 [2019-03-28 12:46:22,598 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.97/11.46 [2019-03-28 12:46:22,599 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. 25.97/11.46 [2019-03-28 12:46:22,621 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 27 transitions. Complement of second has 4 states. 25.97/11.46 [2019-03-28 12:46:22,621 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.97/11.46 [2019-03-28 12:46:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 25.97/11.46 [2019-03-28 12:46:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. 25.97/11.46 [2019-03-28 12:46:22,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 8 letters. Loop has 3 letters. 25.97/11.46 [2019-03-28 12:46:22,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.97/11.46 [2019-03-28 12:46:22,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 11 letters. Loop has 3 letters. 25.97/11.46 [2019-03-28 12:46:22,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.97/11.46 [2019-03-28 12:46:22,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 8 letters. Loop has 6 letters. 25.97/11.46 [2019-03-28 12:46:22,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.97/11.46 [2019-03-28 12:46:22,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. 25.97/11.46 [2019-03-28 12:46:22,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 25.97/11.46 [2019-03-28 12:46:22,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 27 transitions. 25.97/11.46 [2019-03-28 12:46:22,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 25.97/11.46 [2019-03-28 12:46:22,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 25.97/11.46 [2019-03-28 12:46:22,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. 25.97/11.46 [2019-03-28 12:46:22,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.97/11.46 [2019-03-28 12:46:22,627 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. 25.97/11.46 [2019-03-28 12:46:22,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. 25.97/11.46 [2019-03-28 12:46:22,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. 25.97/11.46 [2019-03-28 12:46:22,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 25.97/11.46 [2019-03-28 12:46:22,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. 25.97/11.46 [2019-03-28 12:46:22,629 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. 25.97/11.46 [2019-03-28 12:46:22,629 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. 25.97/11.46 [2019-03-28 12:46:22,629 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 25.97/11.46 [2019-03-28 12:46:22,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. 25.97/11.46 [2019-03-28 12:46:22,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 25.97/11.46 [2019-03-28 12:46:22,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.97/11.46 [2019-03-28 12:46:22,630 INFO L119 BuchiIsEmpty]: Starting construction of run 25.97/11.46 [2019-03-28 12:46:22,630 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 25.97/11.46 [2019-03-28 12:46:22,630 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 25.97/11.46 [2019-03-28 12:46:22,631 INFO L794 eck$LassoCheckResult]: Stem: 653#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: 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~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 654#L8 [107] L8-->L8-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 657#L8-2 [130] L8-2-->L10: Formula: (and (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (< |v_ULTIMATE.start_main_#t~malloc1.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_#length_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 649#L10 [133] L10-->L11-2: Formula: (and (< v_ULTIMATE.start_main_~arr~0.base_5 0) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 650#L11-2 [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 663#L13 [119] L13-->L13-2: Formula: (>= v_ULTIMATE.start_main_~val~0_7 0) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_7} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_7} AuxVars[] AssignedVars[] 655#L13-2 [155] L13-2-->L11-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~i~0_14))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14))) (and (= (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18) 1) (<= 0 .cse0) (= (+ v_ULTIMATE.start_main_~i~0_14 1) v_ULTIMATE.start_main_~i~0_13) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) .cse0 v_ULTIMATE.start_main_~val~0_10)))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 656#L11-2 [154] L11-2-->L18-3: Formula: (and (<= v_ULTIMATE.start_main_~length~0_13 v_ULTIMATE.start_main_~i~0_12) (= 0 v_ULTIMATE.start_main_~j~0_16)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_13} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 645#L18-3 [79] L18-3-->L19-3: Formula: (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~length~0_11) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[] 647#L19-3 25.97/11.46 [2019-03-28 12:46:22,631 INFO L796 eck$LassoCheckResult]: Loop: 647#L19-3 [101] L19-3-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~j~0_10))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_8))) (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~arr~0.base_9)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~arr~0.base_9) .cse0)) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_8 4) (select |v_#length_6| v_ULTIMATE.start_main_~arr~0.base_9)) (<= 0 .cse0)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 651#L19-1 [106] L19-1-->L20: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_6|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 661#L20 [158] L20-->L20-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~j~0_20))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_15))) (and (= |v_ULTIMATE.start_main_#t~post7_6| |v_ULTIMATE.start_main_#t~mem6_6|) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_19) .cse0) |v_ULTIMATE.start_main_#t~mem6_6|) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_15 4) (select |v_#length_12| v_ULTIMATE.start_main_~arr~0.base_19)) (<= 0 .cse0) (= 1 (select |v_#valid_22| v_ULTIMATE.start_main_~arr~0.base_19))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_15, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_19, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_15, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_19, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_6|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~mem6] 659#L20-2 [159] L20-2-->L19-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~j~0_21))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_16))) (and (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~arr~0.base_20 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~arr~0.base_20) .cse0 (+ |v_ULTIMATE.start_main_#t~post7_8| (- 1)))) |v_#memory_int_10|) (<= (+ .cse1 v_ULTIMATE.start_main_~arr~0.offset_16 4) (select |v_#length_13| v_ULTIMATE.start_main_~arr~0.base_20)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~arr~0.base_20)) (<= 0 .cse0)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_16, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_20, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_8|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_16, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_20, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_7|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_7|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~mem6] 647#L19-3 25.97/11.46 [2019-03-28 12:46:22,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.46 [2019-03-28 12:46:22,632 INFO L82 PathProgramCache]: Analyzing trace with hash 756314332, now seen corresponding path program 1 times 25.97/11.46 [2019-03-28 12:46:22,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.46 [2019-03-28 12:46:22,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.46 [2019-03-28 12:46:22,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.46 [2019-03-28 12:46:22,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.46 [2019-03-28 12:46:22,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.46 [2019-03-28 12:46:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.46 [2019-03-28 12:46:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.46 [2019-03-28 12:46:22,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.46 [2019-03-28 12:46:22,645 INFO L82 PathProgramCache]: Analyzing trace with hash 4039335, now seen corresponding path program 1 times 25.97/11.46 [2019-03-28 12:46:22,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.46 [2019-03-28 12:46:22,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.46 [2019-03-28 12:46:22,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.46 [2019-03-28 12:46:22,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.46 [2019-03-28 12:46:22,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.46 [2019-03-28 12:46:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.46 [2019-03-28 12:46:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.46 [2019-03-28 12:46:22,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.46 [2019-03-28 12:46:22,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1180160510, now seen corresponding path program 1 times 25.97/11.46 [2019-03-28 12:46:22,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.97/11.46 [2019-03-28 12:46:22,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.97/11.46 [2019-03-28 12:46:22,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.46 [2019-03-28 12:46:22,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.97/11.46 [2019-03-28 12:46:22,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.97/11.46 [2019-03-28 12:46:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.46 [2019-03-28 12:46:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.46 [2019-03-28 12:46:22,802 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 25.97/11.46 [2019-03-28 12:46:22,839 INFO L216 LassoAnalysis]: Preferences: 25.97/11.46 [2019-03-28 12:46:22,840 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.97/11.46 [2019-03-28 12:46:22,840 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.97/11.46 [2019-03-28 12:46:22,840 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.97/11.46 [2019-03-28 12:46:22,840 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.97/11.46 [2019-03-28 12:46:22,840 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.97/11.46 [2019-03-28 12:46:22,840 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.97/11.46 [2019-03-28 12:46:22,841 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.97/11.46 [2019-03-28 12:46:22,841 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Lasso 25.97/11.46 [2019-03-28 12:46:22,841 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.97/11.46 [2019-03-28 12:46:22,841 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.97/11.46 [2019-03-28 12:46:22,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.46 [2019-03-28 12:46:22,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.46 [2019-03-28 12:46:22,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.46 [2019-03-28 12:46:22,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.46 [2019-03-28 12:46:22,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.46 [2019-03-28 12:46:22,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.46 [2019-03-28 12:46:22,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.46 [2019-03-28 12:46:22,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.46 [2019-03-28 12:46:22,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.46 [2019-03-28 12:46:22,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.46 [2019-03-28 12:46:22,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.97/11.46 [2019-03-28 12:46:23,186 INFO L300 LassoAnalysis]: Preprocessing complete. 25.97/11.46 [2019-03-28 12:46:23,187 INFO L497 LassoAnalysis]: Using template 'affine'. 25.97/11.46 [2019-03-28 12:46:23,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.46 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.46 Number of strict supporting invariants: 0 25.97/11.46 Number of non-strict supporting invariants: 1 25.97/11.46 Consider only non-deceasing supporting invariants: true 25.97/11.46 Simplify termination arguments: true 25.97/11.46 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.46 [2019-03-28 12:46:23,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.46 [2019-03-28 12:46:23,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.97/11.46 [2019-03-28 12:46:23,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.46 [2019-03-28 12:46:23,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.46 [2019-03-28 12:46:23,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.46 [2019-03-28 12:46:23,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.97/11.46 [2019-03-28 12:46:23,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.97/11.46 [2019-03-28 12:46:23,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.46 [2019-03-28 12:46:23,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.46 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.46 Number of strict supporting invariants: 0 25.97/11.46 Number of non-strict supporting invariants: 1 25.97/11.46 Consider only non-deceasing supporting invariants: true 25.97/11.46 Simplify termination arguments: true 25.97/11.46 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.46 [2019-03-28 12:46:23,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.46 [2019-03-28 12:46:23,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.97/11.46 [2019-03-28 12:46:23,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.46 [2019-03-28 12:46:23,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.46 [2019-03-28 12:46:23,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.46 [2019-03-28 12:46:23,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.97/11.46 [2019-03-28 12:46:23,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.97/11.46 [2019-03-28 12:46:23,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.46 [2019-03-28 12:46:23,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.46 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.46 Number of strict supporting invariants: 0 25.97/11.46 Number of non-strict supporting invariants: 1 25.97/11.46 Consider only non-deceasing supporting invariants: true 25.97/11.46 Simplify termination arguments: true 25.97/11.46 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.46 [2019-03-28 12:46:23,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.46 [2019-03-28 12:46:23,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.97/11.46 [2019-03-28 12:46:23,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.46 [2019-03-28 12:46:23,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.46 [2019-03-28 12:46:23,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.46 [2019-03-28 12:46:23,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.97/11.46 [2019-03-28 12:46:23,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.97/11.46 [2019-03-28 12:46:23,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.46 [2019-03-28 12:46:23,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.46 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.46 Number of strict supporting invariants: 0 25.97/11.46 Number of non-strict supporting invariants: 1 25.97/11.46 Consider only non-deceasing supporting invariants: true 25.97/11.46 Simplify termination arguments: true 25.97/11.46 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.46 [2019-03-28 12:46:23,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.46 [2019-03-28 12:46:23,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.46 [2019-03-28 12:46:23,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.46 [2019-03-28 12:46:23,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.46 [2019-03-28 12:46:23,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.97/11.46 [2019-03-28 12:46:23,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.97/11.46 [2019-03-28 12:46:23,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.46 [2019-03-28 12:46:23,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.46 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.46 Number of strict supporting invariants: 0 25.97/11.46 Number of non-strict supporting invariants: 1 25.97/11.46 Consider only non-deceasing supporting invariants: true 25.97/11.46 Simplify termination arguments: true 25.97/11.46 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.46 [2019-03-28 12:46:23,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.46 [2019-03-28 12:46:23,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.46 [2019-03-28 12:46:23,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.46 [2019-03-28 12:46:23,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.46 [2019-03-28 12:46:23,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.97/11.46 [2019-03-28 12:46:23,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.97/11.46 [2019-03-28 12:46:23,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.46 [2019-03-28 12:46:23,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.46 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.46 Number of strict supporting invariants: 0 25.97/11.46 Number of non-strict supporting invariants: 1 25.97/11.46 Consider only non-deceasing supporting invariants: true 25.97/11.46 Simplify termination arguments: true 25.97/11.46 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.46 [2019-03-28 12:46:23,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.46 [2019-03-28 12:46:23,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.97/11.46 [2019-03-28 12:46:23,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.46 [2019-03-28 12:46:23,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.46 [2019-03-28 12:46:23,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.46 [2019-03-28 12:46:23,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.97/11.46 [2019-03-28 12:46:23,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.97/11.46 [2019-03-28 12:46:23,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.46 [2019-03-28 12:46:23,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.46 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.46 Number of strict supporting invariants: 0 25.97/11.46 Number of non-strict supporting invariants: 1 25.97/11.46 Consider only non-deceasing supporting invariants: true 25.97/11.46 Simplify termination arguments: true 25.97/11.46 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.46 [2019-03-28 12:46:23,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.46 [2019-03-28 12:46:23,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.97/11.46 [2019-03-28 12:46:23,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.46 [2019-03-28 12:46:23,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.46 [2019-03-28 12:46:23,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.46 [2019-03-28 12:46:23,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.97/11.46 [2019-03-28 12:46:23,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.97/11.46 [2019-03-28 12:46:23,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.46 [2019-03-28 12:46:23,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.46 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.46 Number of strict supporting invariants: 0 25.97/11.46 Number of non-strict supporting invariants: 1 25.97/11.46 Consider only non-deceasing supporting invariants: true 25.97/11.46 Simplify termination arguments: true 25.97/11.46 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.46 [2019-03-28 12:46:23,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.46 [2019-03-28 12:46:23,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.97/11.46 [2019-03-28 12:46:23,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.46 [2019-03-28 12:46:23,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.46 [2019-03-28 12:46:23,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.46 [2019-03-28 12:46:23,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.97/11.46 [2019-03-28 12:46:23,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.97/11.46 [2019-03-28 12:46:23,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.46 [2019-03-28 12:46:23,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.46 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.46 Number of strict supporting invariants: 0 25.97/11.46 Number of non-strict supporting invariants: 1 25.97/11.46 Consider only non-deceasing supporting invariants: true 25.97/11.46 Simplify termination arguments: true 25.97/11.46 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.46 [2019-03-28 12:46:23,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.46 [2019-03-28 12:46:23,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.97/11.46 [2019-03-28 12:46:23,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.46 [2019-03-28 12:46:23,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.46 [2019-03-28 12:46:23,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.46 [2019-03-28 12:46:23,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.97/11.46 [2019-03-28 12:46:23,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.97/11.46 [2019-03-28 12:46:23,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.46 [2019-03-28 12:46:23,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.46 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.46 Number of strict supporting invariants: 0 25.97/11.46 Number of non-strict supporting invariants: 1 25.97/11.46 Consider only non-deceasing supporting invariants: true 25.97/11.46 Simplify termination arguments: true 25.97/11.46 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.46 [2019-03-28 12:46:23,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.46 [2019-03-28 12:46:23,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.97/11.46 [2019-03-28 12:46:23,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.46 [2019-03-28 12:46:23,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.46 [2019-03-28 12:46:23,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.46 [2019-03-28 12:46:23,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.97/11.46 [2019-03-28 12:46:23,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.97/11.46 [2019-03-28 12:46:23,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.46 [2019-03-28 12:46:23,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.46 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.46 Number of strict supporting invariants: 0 25.97/11.46 Number of non-strict supporting invariants: 1 25.97/11.46 Consider only non-deceasing supporting invariants: true 25.97/11.46 Simplify termination arguments: true 25.97/11.46 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.46 [2019-03-28 12:46:23,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.46 [2019-03-28 12:46:23,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.46 [2019-03-28 12:46:23,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.46 [2019-03-28 12:46:23,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.46 [2019-03-28 12:46:23,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.97/11.46 [2019-03-28 12:46:23,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.97/11.46 [2019-03-28 12:46:23,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.46 [2019-03-28 12:46:23,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.46 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.46 Number of strict supporting invariants: 0 25.97/11.46 Number of non-strict supporting invariants: 1 25.97/11.46 Consider only non-deceasing supporting invariants: true 25.97/11.46 Simplify termination arguments: true 25.97/11.46 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.46 [2019-03-28 12:46:23,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.46 [2019-03-28 12:46:23,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.46 [2019-03-28 12:46:23,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.46 [2019-03-28 12:46:23,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.46 [2019-03-28 12:46:23,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.97/11.46 [2019-03-28 12:46:23,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.97/11.46 [2019-03-28 12:46:23,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.46 [2019-03-28 12:46:23,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.46 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.46 Number of strict supporting invariants: 0 25.97/11.46 Number of non-strict supporting invariants: 1 25.97/11.46 Consider only non-deceasing supporting invariants: true 25.97/11.46 Simplify termination arguments: true 25.97/11.46 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.46 [2019-03-28 12:46:23,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.46 [2019-03-28 12:46:23,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.46 [2019-03-28 12:46:23,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.46 [2019-03-28 12:46:23,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.46 [2019-03-28 12:46:23,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.97/11.46 [2019-03-28 12:46:23,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.97/11.46 [2019-03-28 12:46:23,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.46 [2019-03-28 12:46:23,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.46 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.46 Number of strict supporting invariants: 0 25.97/11.46 Number of non-strict supporting invariants: 1 25.97/11.46 Consider only non-deceasing supporting invariants: true 25.97/11.46 Simplify termination arguments: true 25.97/11.46 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.46 [2019-03-28 12:46:23,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.46 [2019-03-28 12:46:23,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.46 [2019-03-28 12:46:23,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.46 [2019-03-28 12:46:23,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.46 [2019-03-28 12:46:23,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.97/11.46 [2019-03-28 12:46:23,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.97/11.46 [2019-03-28 12:46:23,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.97/11.46 [2019-03-28 12:46:23,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.97/11.46 Termination analysis: LINEAR_WITH_GUESSES 25.97/11.46 Number of strict supporting invariants: 0 25.97/11.46 Number of non-strict supporting invariants: 1 25.97/11.46 Consider only non-deceasing supporting invariants: true 25.97/11.46 Simplify termination arguments: true 25.97/11.46 Simplify supporting invariants: trueOverapproximate stem: false 25.97/11.46 [2019-03-28 12:46:23,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.97/11.46 [2019-03-28 12:46:23,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.97/11.46 [2019-03-28 12:46:23,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.97/11.46 [2019-03-28 12:46:23,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.97/11.46 [2019-03-28 12:46:23,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.97/11.46 [2019-03-28 12:46:23,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.97/11.46 [2019-03-28 12:46:23,247 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.97/11.46 [2019-03-28 12:46:23,254 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 25.97/11.46 [2019-03-28 12:46:23,254 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. 25.97/11.46 [2019-03-28 12:46:23,254 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.97/11.46 [2019-03-28 12:46:23,255 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 25.97/11.46 [2019-03-28 12:46:23,256 INFO L518 LassoAnalysis]: Proved termination. 25.97/11.46 [2019-03-28 12:46:23,256 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.97/11.46 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~j~0)))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~j~0)))_2 25.97/11.46 Supporting invariants [] 25.97/11.46 [2019-03-28 12:46:23,264 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed 25.97/11.46 [2019-03-28 12:46:23,266 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 25.97/11.46 [2019-03-28 12:46:23,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.97/11.46 [2019-03-28 12:46:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.97/11.46 [2019-03-28 12:46:23,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core 25.97/11.46 [2019-03-28 12:46:23,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.97/11.46 [2019-03-28 12:46:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.97/11.46 [2019-03-28 12:46:23,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core 25.97/11.46 [2019-03-28 12:46:23,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.97/11.46 [2019-03-28 12:46:23,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.97/11.46 [2019-03-28 12:46:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.97/11.46 [2019-03-28 12:46:23,413 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 25.97/11.46 [2019-03-28 12:46:23,413 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 25.97/11.46 [2019-03-28 12:46:23,414 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 4 loop predicates 25.97/11.46 [2019-03-28 12:46:23,414 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 5 states. 25.97/11.46 [2019-03-28 12:46:23,455 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 19 states and 26 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 26 states and 34 transitions. Complement of second has 8 states. 25.97/11.46 [2019-03-28 12:46:23,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 25.97/11.46 [2019-03-28 12:46:23,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 25.97/11.46 [2019-03-28 12:46:23,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. 25.97/11.46 [2019-03-28 12:46:23,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 9 letters. Loop has 4 letters. 25.97/11.46 [2019-03-28 12:46:23,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.97/11.46 [2019-03-28 12:46:23,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 13 letters. Loop has 4 letters. 25.97/11.46 [2019-03-28 12:46:23,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.97/11.46 [2019-03-28 12:46:23,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 9 letters. Loop has 8 letters. 25.97/11.46 [2019-03-28 12:46:23,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.97/11.46 [2019-03-28 12:46:23,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. 25.97/11.46 [2019-03-28 12:46:23,461 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 25.97/11.46 [2019-03-28 12:46:23,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. 25.97/11.46 [2019-03-28 12:46:23,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 25.97/11.46 [2019-03-28 12:46:23,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 25.97/11.46 [2019-03-28 12:46:23,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 25.97/11.46 [2019-03-28 12:46:23,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.97/11.46 [2019-03-28 12:46:23,461 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.97/11.46 [2019-03-28 12:46:23,462 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.97/11.46 [2019-03-28 12:46:23,462 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.97/11.46 [2019-03-28 12:46:23,462 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ 25.97/11.46 [2019-03-28 12:46:23,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 25.97/11.46 [2019-03-28 12:46:23,462 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 25.97/11.46 [2019-03-28 12:46:23,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 25.97/11.46 [2019-03-28 12:46:23,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:23 BasicIcfg 25.97/11.46 [2019-03-28 12:46:23,469 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 25.97/11.46 [2019-03-28 12:46:23,469 INFO L168 Benchmark]: Toolchain (without parser) took 6817.35 ms. Allocated memory was 649.6 MB in the beginning and 864.0 MB in the end (delta: 214.4 MB). Free memory was 558.4 MB in the beginning and 747.7 MB in the end (delta: -189.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 50.3 GB. 25.97/11.46 [2019-03-28 12:46:23,470 INFO L168 Benchmark]: CDTParser took 0.20 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.97/11.46 [2019-03-28 12:46:23,470 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.10 ms. Allocated memory was 649.6 MB in the beginning and 687.9 MB in the end (delta: 38.3 MB). Free memory was 558.4 MB in the beginning and 654.3 MB in the end (delta: -95.9 MB). Peak memory consumption was 30.3 MB. Max. memory is 50.3 GB. 25.97/11.46 [2019-03-28 12:46:23,471 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.79 ms. Allocated memory is still 687.9 MB. Free memory was 653.0 MB in the beginning and 649.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 50.3 GB. 25.97/11.46 [2019-03-28 12:46:23,472 INFO L168 Benchmark]: Boogie Preprocessor took 26.19 ms. Allocated memory is still 687.9 MB. Free memory was 649.8 MB in the beginning and 648.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 25.97/11.46 [2019-03-28 12:46:23,472 INFO L168 Benchmark]: RCFGBuilder took 280.69 ms. Allocated memory is still 687.9 MB. Free memory was 648.5 MB in the beginning and 627.4 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 50.3 GB. 25.97/11.46 [2019-03-28 12:46:23,473 INFO L168 Benchmark]: BlockEncodingV2 took 117.70 ms. Allocated memory is still 687.9 MB. Free memory was 627.4 MB in the beginning and 619.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 25.97/11.46 [2019-03-28 12:46:23,473 INFO L168 Benchmark]: TraceAbstraction took 1702.19 ms. Allocated memory is still 687.9 MB. Free memory was 619.3 MB in the beginning and 428.7 MB in the end (delta: 190.6 MB). Peak memory consumption was 190.6 MB. Max. memory is 50.3 GB. 25.97/11.46 [2019-03-28 12:46:23,474 INFO L168 Benchmark]: BuchiAutomizer took 4346.38 ms. Allocated memory was 687.9 MB in the beginning and 864.0 MB in the end (delta: 176.2 MB). Free memory was 428.7 MB in the beginning and 747.7 MB in the end (delta: -318.9 MB). There was no memory consumed. Max. memory is 50.3 GB. 25.97/11.46 [2019-03-28 12:46:23,478 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 25.97/11.46 --- Results --- 25.97/11.46 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 25.97/11.46 - StatisticsResult: Initial Icfg 25.97/11.46 30 locations, 38 edges 25.97/11.46 - StatisticsResult: Encoded RCFG 25.97/11.46 20 locations, 36 edges 25.97/11.46 * Results from de.uni_freiburg.informatik.ultimate.core: 25.97/11.46 - StatisticsResult: Toolchain Benchmarks 25.97/11.46 Benchmark results are: 25.97/11.46 * CDTParser took 0.20 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.97/11.46 * CACSL2BoogieTranslator took 299.10 ms. Allocated memory was 649.6 MB in the beginning and 687.9 MB in the end (delta: 38.3 MB). Free memory was 558.4 MB in the beginning and 654.3 MB in the end (delta: -95.9 MB). Peak memory consumption was 30.3 MB. Max. memory is 50.3 GB. 25.97/11.46 * Boogie Procedure Inliner took 39.79 ms. Allocated memory is still 687.9 MB. Free memory was 653.0 MB in the beginning and 649.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 50.3 GB. 25.97/11.46 * Boogie Preprocessor took 26.19 ms. Allocated memory is still 687.9 MB. Free memory was 649.8 MB in the beginning and 648.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 25.97/11.46 * RCFGBuilder took 280.69 ms. Allocated memory is still 687.9 MB. Free memory was 648.5 MB in the beginning and 627.4 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 50.3 GB. 25.97/11.46 * BlockEncodingV2 took 117.70 ms. Allocated memory is still 687.9 MB. Free memory was 627.4 MB in the beginning and 619.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 25.97/11.46 * TraceAbstraction took 1702.19 ms. Allocated memory is still 687.9 MB. Free memory was 619.3 MB in the beginning and 428.7 MB in the end (delta: 190.6 MB). Peak memory consumption was 190.6 MB. Max. memory is 50.3 GB. 25.97/11.46 * BuchiAutomizer took 4346.38 ms. Allocated memory was 687.9 MB in the beginning and 864.0 MB in the end (delta: 176.2 MB). Free memory was 428.7 MB in the beginning and 747.7 MB in the end (delta: -318.9 MB). There was no memory consumed. Max. memory is 50.3 GB. 25.97/11.46 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #length 25.97/11.46 - GenericResult: Unfinished Backtranslation 25.97/11.46 unknown boogie variable #memory_int 25.97/11.46 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 25.97/11.46 - PositiveResult [Line: 19]: pointer dereference always succeeds 25.97/11.46 For all program executions holds that pointer dereference always succeeds at this location 25.97/11.46 - PositiveResult [Line: 19]: pointer dereference always succeeds 25.97/11.46 For all program executions holds that pointer dereference always succeeds at this location 25.97/11.46 - PositiveResult [Line: 16]: pointer dereference always succeeds 25.97/11.46 For all program executions holds that pointer dereference always succeeds at this location 25.97/11.46 - PositiveResult [Line: 20]: pointer dereference always succeeds 25.97/11.46 For all program executions holds that pointer dereference always succeeds at this location 25.97/11.46 - PositiveResult [Line: 20]: pointer dereference always succeeds 25.97/11.46 For all program executions holds that pointer dereference always succeeds at this location 25.97/11.46 - PositiveResult [Line: 20]: pointer dereference always succeeds 25.97/11.46 For all program executions holds that pointer dereference always succeeds at this location 25.97/11.46 - PositiveResult [Line: 16]: pointer dereference always succeeds 25.97/11.46 For all program executions holds that pointer dereference always succeeds at this location 25.97/11.46 - PositiveResult [Line: 20]: pointer dereference always succeeds 25.97/11.46 For all program executions holds that pointer dereference always succeeds at this location 25.97/11.46 - AllSpecificationsHoldResult: All specifications hold 25.97/11.46 8 specifications checked. All of them hold 25.97/11.46 - InvariantResult [Line: 18]: Loop Invariant 25.97/11.46 [2019-03-28 12:46:23,487 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.46 [2019-03-28 12:46:23,487 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.46 [2019-03-28 12:46:23,487 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.46 [2019-03-28 12:46:23,487 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.46 [2019-03-28 12:46:23,488 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.46 [2019-03-28 12:46:23,489 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.46 [2019-03-28 12:46:23,489 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.46 [2019-03-28 12:46:23,489 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.46 Derived loop invariant: (((((arr + 4 * i <= unknown-#length-unknown[arr] && 4 <= arr + 4 * i) && unknown-#length-unknown[arr] == 4 * length) && 1 == \valid[arr]) && arr == 0) && j == 0) || (((((arr + 4 * i <= unknown-#length-unknown[arr] && 4 <= arr + 4 * i) && unknown-#length-unknown[arr] == 4 * length) && 1 == \valid[arr]) && arr == 0) && 4 <= arr + 4 * j) 25.97/11.46 - InvariantResult [Line: 19]: Loop Invariant 25.97/11.46 [2019-03-28 12:46:23,490 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.46 [2019-03-28 12:46:23,490 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.46 [2019-03-28 12:46:23,490 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.46 [2019-03-28 12:46:23,491 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.46 [2019-03-28 12:46:23,491 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.46 [2019-03-28 12:46:23,492 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.46 [2019-03-28 12:46:23,492 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.46 [2019-03-28 12:46:23,492 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.46 [2019-03-28 12:46:23,493 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.46 [2019-03-28 12:46:23,493 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.46 Derived loop invariant: ((((((arr + 4 * j + 4 <= unknown-#length-unknown[arr] && arr + 4 * i <= unknown-#length-unknown[arr]) && 4 <= arr + 4 * i) && unknown-#length-unknown[arr] == 4 * length) && 1 == \valid[arr]) && arr == 0) && 4 <= arr + 4 * j) || (((((arr + 4 * i <= unknown-#length-unknown[arr] && 4 <= arr + 4 * i) && unknown-#length-unknown[arr] == 4 * length) && 1 == \valid[arr]) && arr == 0) && j == 0) 25.97/11.46 - InvariantResult [Line: 11]: Loop Invariant 25.97/11.46 [2019-03-28 12:46:23,493 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.46 [2019-03-28 12:46:23,494 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.46 [2019-03-28 12:46:23,494 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.46 [2019-03-28 12:46:23,495 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.46 [2019-03-28 12:46:23,495 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.46 [2019-03-28 12:46:23,495 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.97/11.46 Derived loop invariant: ((((1 <= length && unknown-#length-unknown[arr] == 4 * length) && 1 == \valid[arr]) && i == 0) && arr == 0) || ((((arr + 4 * i <= unknown-#length-unknown[arr] && 4 <= arr + 4 * i) && unknown-#length-unknown[arr] == 4 * length) && 1 == \valid[arr]) && arr == 0) 25.97/11.46 - StatisticsResult: Ultimate Automizer benchmark data 25.97/11.46 CFG has 1 procedures, 20 locations, 8 error locations. SAFE Result, 1.6s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 64 SDtfs, 224 SDslu, 67 SDs, 0 SdLazy, 316 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=8, 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, 27 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 10 NumberOfFragments, 215 HoareAnnotationTreeSize, 3 FomulaSimplifications, 149 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 79 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 1932 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 8/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 25.97/11.46 - StatisticsResult: Constructed decomposition of program 25.97/11.46 Your program was decomposed into 9 terminating modules (4 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[arr] + -1 * arr + -4 * i and consists of 3 locations. One nondeterministic module has affine ranking function -4 * i + -1 * arr + 1 and consists of 7 locations. One nondeterministic module has affine ranking function -1 * i + length and consists of 4 locations. One nondeterministic module has affine ranking function -1 * j + length and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[arr][arr + 4 * j] and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 4 locations. 25.97/11.46 - StatisticsResult: Timing statistics 25.97/11.46 BüchiAutomizer plugin needed 4.3s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 3.1s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 8. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 66 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 5. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 114 SDtfs, 245 SDslu, 80 SDs, 0 SdLazy, 249 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU4 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital116 mio100 ax100 hnf100 lsp93 ukn83 mio100 lsp60 div100 bol100 ite100 ukn100 eq171 hnf88 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 25.97/11.46 - TerminationAnalysisResult: Termination proven 25.97/11.46 Buchi Automizer proved that your program is terminating 25.97/11.46 RESULT: Ultimate proved your program to be correct! 25.97/11.46 !SESSION 2019-03-28 12:46:13.300 ----------------------------------------------- 25.97/11.46 eclipse.buildId=unknown 25.97/11.46 java.version=1.8.0_181 25.97/11.46 java.vendor=Oracle Corporation 25.97/11.46 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 25.97/11.46 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 25.97/11.46 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.97/11.46 25.97/11.46 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:46:23.722 25.97/11.46 !MESSAGE The workspace will exit with unsaved changes in this session. 25.97/11.46 Received shutdown request... 25.97/11.46 Ultimate: 25.97/11.46 GTK+ Version Check 25.97/11.46 EOF