22.57/9.58 YES 22.57/9.58 22.57/9.58 Ultimate: Cannot open display: 22.57/9.58 This is Ultimate 0.1.24-8dc7c08-m 22.57/9.58 [2019-03-28 12:44:01,000 INFO L170 SettingsManager]: Resetting all preferences to default values... 22.57/9.58 [2019-03-28 12:44:01,003 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 22.57/9.58 [2019-03-28 12:44:01,014 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 22.57/9.58 [2019-03-28 12:44:01,014 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 22.57/9.58 [2019-03-28 12:44:01,015 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 22.57/9.58 [2019-03-28 12:44:01,016 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 22.57/9.58 [2019-03-28 12:44:01,018 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 22.57/9.58 [2019-03-28 12:44:01,019 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 22.57/9.58 [2019-03-28 12:44:01,020 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 22.57/9.58 [2019-03-28 12:44:01,021 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 22.57/9.58 [2019-03-28 12:44:01,021 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 22.57/9.58 [2019-03-28 12:44:01,022 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 22.57/9.58 [2019-03-28 12:44:01,023 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 22.57/9.58 [2019-03-28 12:44:01,024 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 22.57/9.58 [2019-03-28 12:44:01,025 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 22.57/9.58 [2019-03-28 12:44:01,026 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 22.57/9.58 [2019-03-28 12:44:01,027 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 22.57/9.58 [2019-03-28 12:44:01,029 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 22.57/9.58 [2019-03-28 12:44:01,030 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 22.57/9.58 [2019-03-28 12:44:01,031 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 22.57/9.58 [2019-03-28 12:44:01,032 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 22.57/9.58 [2019-03-28 12:44:01,035 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 22.57/9.58 [2019-03-28 12:44:01,035 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 22.57/9.58 [2019-03-28 12:44:01,035 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 22.57/9.58 [2019-03-28 12:44:01,036 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 22.57/9.58 [2019-03-28 12:44:01,036 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 22.57/9.58 [2019-03-28 12:44:01,037 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 22.57/9.58 [2019-03-28 12:44:01,037 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 22.57/9.58 [2019-03-28 12:44:01,038 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 22.57/9.58 [2019-03-28 12:44:01,039 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 22.57/9.58 [2019-03-28 12:44:01,039 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 22.57/9.58 [2019-03-28 12:44:01,040 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 22.57/9.58 [2019-03-28 12:44:01,040 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 22.57/9.58 [2019-03-28 12:44:01,041 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 22.57/9.58 [2019-03-28 12:44:01,041 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 22.57/9.58 [2019-03-28 12:44:01,041 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 22.57/9.58 [2019-03-28 12:44:01,042 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 22.57/9.58 [2019-03-28 12:44:01,043 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 22.57/9.58 [2019-03-28 12:44:01,043 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 22.57/9.58 [2019-03-28 12:44:01,058 INFO L110 SettingsManager]: Loading preferences was successful 22.57/9.58 [2019-03-28 12:44:01,058 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 22.57/9.58 [2019-03-28 12:44:01,059 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 22.57/9.58 [2019-03-28 12:44:01,059 INFO L133 SettingsManager]: * Rewrite not-equals=true 22.57/9.58 [2019-03-28 12:44:01,059 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 22.57/9.58 [2019-03-28 12:44:01,060 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 22.57/9.58 [2019-03-28 12:44:01,060 INFO L133 SettingsManager]: * Use SBE=true 22.57/9.58 [2019-03-28 12:44:01,060 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 22.57/9.58 [2019-03-28 12:44:01,060 INFO L133 SettingsManager]: * Use old map elimination=false 22.57/9.58 [2019-03-28 12:44:01,060 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 22.57/9.58 [2019-03-28 12:44:01,060 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 22.57/9.58 [2019-03-28 12:44:01,061 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 22.57/9.58 [2019-03-28 12:44:01,061 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 22.57/9.58 [2019-03-28 12:44:01,061 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 22.57/9.58 [2019-03-28 12:44:01,061 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.57/9.58 [2019-03-28 12:44:01,061 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 22.57/9.58 [2019-03-28 12:44:01,061 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 22.57/9.58 [2019-03-28 12:44:01,062 INFO L133 SettingsManager]: * Check division by zero=IGNORE 22.57/9.58 [2019-03-28 12:44:01,062 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 22.57/9.58 [2019-03-28 12:44:01,062 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 22.57/9.58 [2019-03-28 12:44:01,062 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 22.57/9.58 [2019-03-28 12:44:01,062 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 22.57/9.58 [2019-03-28 12:44:01,063 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 22.57/9.58 [2019-03-28 12:44:01,063 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 22.57/9.58 [2019-03-28 12:44:01,063 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 22.57/9.58 [2019-03-28 12:44:01,063 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 22.57/9.58 [2019-03-28 12:44:01,063 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 22.57/9.58 [2019-03-28 12:44:01,063 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 22.57/9.58 [2019-03-28 12:44:01,064 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 22.57/9.58 [2019-03-28 12:44:01,089 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 22.57/9.58 [2019-03-28 12:44:01,102 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 22.57/9.58 [2019-03-28 12:44:01,105 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 22.57/9.58 [2019-03-28 12:44:01,107 INFO L271 PluginConnector]: Initializing CDTParser... 22.57/9.58 [2019-03-28 12:44:01,107 INFO L276 PluginConnector]: CDTParser initialized 22.57/9.58 [2019-03-28 12:44:01,108 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 22.57/9.58 [2019-03-28 12:44:01,168 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/64d621ec50964a1ebe15558f1f74906c/FLAGcbae5d5e2 22.57/9.58 [2019-03-28 12:44:01,514 INFO L307 CDTParser]: Found 1 translation units. 22.57/9.58 [2019-03-28 12:44:01,514 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 22.57/9.58 [2019-03-28 12:44:01,515 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 22.57/9.58 [2019-03-28 12:44:01,522 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/64d621ec50964a1ebe15558f1f74906c/FLAGcbae5d5e2 22.57/9.58 [2019-03-28 12:44:01,915 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/64d621ec50964a1ebe15558f1f74906c 22.57/9.58 [2019-03-28 12:44:01,927 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 22.57/9.58 [2019-03-28 12:44:01,929 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 22.57/9.58 [2019-03-28 12:44:01,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 22.57/9.58 [2019-03-28 12:44:01,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 22.57/9.58 [2019-03-28 12:44:01,934 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 22.57/9.58 [2019-03-28 12:44:01,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:44:01" (1/1) ... 22.57/9.58 [2019-03-28 12:44:01,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@699a6793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:01, skipping insertion in model container 22.57/9.58 [2019-03-28 12:44:01,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:44:01" (1/1) ... 22.57/9.58 [2019-03-28 12:44:01,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 22.57/9.58 [2019-03-28 12:44:01,965 INFO L176 MainTranslator]: Built tables and reachable declarations 22.57/9.58 [2019-03-28 12:44:02,134 INFO L206 PostProcessor]: Analyzing one entry point: main 22.57/9.58 [2019-03-28 12:44:02,147 INFO L191 MainTranslator]: Completed pre-run 22.57/9.58 [2019-03-28 12:44:02,228 INFO L206 PostProcessor]: Analyzing one entry point: main 22.57/9.58 [2019-03-28 12:44:02,245 INFO L195 MainTranslator]: Completed translation 22.57/9.58 [2019-03-28 12:44:02,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02 WrapperNode 22.57/9.58 [2019-03-28 12:44:02,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 22.57/9.58 [2019-03-28 12:44:02,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 22.57/9.58 [2019-03-28 12:44:02,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 22.57/9.58 [2019-03-28 12:44:02,247 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 22.57/9.58 [2019-03-28 12:44:02,256 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:44:02" (1/1) ... 22.57/9.58 [2019-03-28 12:44:02,264 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:44:02" (1/1) ... 22.57/9.58 [2019-03-28 12:44:02,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 22.57/9.58 [2019-03-28 12:44:02,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 22.57/9.58 [2019-03-28 12:44:02,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 22.57/9.58 [2019-03-28 12:44:02,287 INFO L276 PluginConnector]: Boogie Preprocessor initialized 22.57/9.58 [2019-03-28 12:44:02,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02" (1/1) ... 22.57/9.58 [2019-03-28 12:44:02,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02" (1/1) ... 22.57/9.58 [2019-03-28 12:44:02,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02" (1/1) ... 22.57/9.58 [2019-03-28 12:44:02,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02" (1/1) ... 22.57/9.58 [2019-03-28 12:44:02,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02" (1/1) ... 22.57/9.58 [2019-03-28 12:44:02,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02" (1/1) ... 22.57/9.58 [2019-03-28 12:44:02,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02" (1/1) ... 22.57/9.58 [2019-03-28 12:44:02,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 22.57/9.58 [2019-03-28 12:44:02,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 22.57/9.58 [2019-03-28 12:44:02,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... 22.57/9.58 [2019-03-28 12:44:02,313 INFO L276 PluginConnector]: RCFGBuilder initialized 22.57/9.58 [2019-03-28 12:44:02,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02" (1/1) ... 22.57/9.58 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.57/9.58 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 22.57/9.58 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 22.57/9.58 [2019-03-28 12:44:02,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 22.57/9.58 [2019-03-28 12:44:02,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 22.57/9.58 [2019-03-28 12:44:02,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 22.57/9.58 [2019-03-28 12:44:02,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 22.57/9.58 [2019-03-28 12:44:02,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 22.57/9.58 [2019-03-28 12:44:02,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 22.57/9.58 [2019-03-28 12:44:02,627 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 22.57/9.58 [2019-03-28 12:44:02,628 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. 22.57/9.58 [2019-03-28 12:44:02,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:02 BoogieIcfgContainer 22.57/9.58 [2019-03-28 12:44:02,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 22.57/9.58 [2019-03-28 12:44:02,630 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 22.57/9.58 [2019-03-28 12:44:02,630 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 22.57/9.58 [2019-03-28 12:44:02,633 INFO L276 PluginConnector]: BlockEncodingV2 initialized 22.57/9.58 [2019-03-28 12:44:02,633 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:02" (1/1) ... 22.57/9.58 [2019-03-28 12:44:02,656 INFO L313 BlockEncoder]: Initial Icfg 33 locations, 38 edges 22.57/9.58 [2019-03-28 12:44:02,658 INFO L258 BlockEncoder]: Using Remove infeasible edges 22.57/9.58 [2019-03-28 12:44:02,658 INFO L263 BlockEncoder]: Using Maximize final states 22.57/9.58 [2019-03-28 12:44:02,659 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 22.57/9.58 [2019-03-28 12:44:02,659 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 22.57/9.58 [2019-03-28 12:44:02,661 INFO L296 BlockEncoder]: Using Remove sink states 22.57/9.58 [2019-03-28 12:44:02,662 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 22.57/9.58 [2019-03-28 12:44:02,662 INFO L179 BlockEncoder]: Using Rewrite not-equals 22.57/9.58 [2019-03-28 12:44:02,686 INFO L185 BlockEncoder]: Using Use SBE 22.57/9.58 [2019-03-28 12:44:02,711 INFO L200 BlockEncoder]: SBE split 13 edges 22.57/9.58 [2019-03-28 12:44:02,717 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 22.57/9.58 [2019-03-28 12:44:02,719 INFO L71 MaximizeFinalStates]: 0 new accepting states 22.57/9.58 [2019-03-28 12:44:02,749 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 22.57/9.58 [2019-03-28 12:44:02,752 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 22.57/9.58 [2019-03-28 12:44:02,754 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 22.57/9.58 [2019-03-28 12:44:02,754 INFO L71 MaximizeFinalStates]: 0 new accepting states 22.57/9.58 [2019-03-28 12:44:02,754 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 22.57/9.58 [2019-03-28 12:44:02,755 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 22.57/9.58 [2019-03-28 12:44:02,756 INFO L313 BlockEncoder]: Encoded RCFG 25 locations, 41 edges 22.57/9.58 [2019-03-28 12:44:02,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:44:02 BasicIcfg 22.57/9.58 [2019-03-28 12:44:02,756 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 22.57/9.58 [2019-03-28 12:44:02,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 22.57/9.58 [2019-03-28 12:44:02,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... 22.57/9.58 [2019-03-28 12:44:02,761 INFO L276 PluginConnector]: TraceAbstraction initialized 22.57/9.58 [2019-03-28 12:44:02,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:44:01" (1/4) ... 22.57/9.58 [2019-03-28 12:44:02,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798fa4e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:44:02, skipping insertion in model container 22.57/9.58 [2019-03-28 12:44:02,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02" (2/4) ... 22.57/9.58 [2019-03-28 12:44:02,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798fa4e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:44:02, skipping insertion in model container 22.57/9.58 [2019-03-28 12:44:02,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:02" (3/4) ... 22.57/9.58 [2019-03-28 12:44:02,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798fa4e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:44:02, skipping insertion in model container 22.57/9.58 [2019-03-28 12:44:02,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:44:02" (4/4) ... 22.57/9.58 [2019-03-28 12:44:02,765 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 22.57/9.58 [2019-03-28 12:44:02,775 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 22.57/9.58 [2019-03-28 12:44:02,783 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. 22.57/9.58 [2019-03-28 12:44:02,800 INFO L257 AbstractCegarLoop]: Starting to check reachability of 12 error locations. 22.57/9.58 [2019-03-28 12:44:02,829 INFO L133 ementStrategyFactory]: Using default assertion order modulation 22.57/9.58 [2019-03-28 12:44:02,830 INFO L382 AbstractCegarLoop]: Interprodecural is true 22.57/9.58 [2019-03-28 12:44:02,830 INFO L383 AbstractCegarLoop]: Hoare is true 22.57/9.58 [2019-03-28 12:44:02,830 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 22.57/9.58 [2019-03-28 12:44:02,831 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 22.57/9.58 [2019-03-28 12:44:02,831 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 22.57/9.58 [2019-03-28 12:44:02,831 INFO L387 AbstractCegarLoop]: Difference is false 22.57/9.58 [2019-03-28 12:44:02,831 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 22.57/9.58 [2019-03-28 12:44:02,831 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 22.57/9.58 [2019-03-28 12:44:02,846 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. 22.57/9.58 [2019-03-28 12:44:02,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 22.57/9.58 [2019-03-28 12:44:02,852 INFO L394 BasicCegarLoop]: Found error trace 22.57/9.58 [2019-03-28 12:44:02,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 22.57/9.58 [2019-03-28 12:44:02,853 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 22.57/9.58 [2019-03-28 12:44:02,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.57/9.58 [2019-03-28 12:44:02,859 INFO L82 PathProgramCache]: Analyzing trace with hash 823111807, now seen corresponding path program 1 times 22.57/9.58 [2019-03-28 12:44:02,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.57/9.58 [2019-03-28 12:44:02,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.57/9.58 [2019-03-28 12:44:02,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:02,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:02,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.57/9.58 [2019-03-28 12:44:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.57/9.58 [2019-03-28 12:44:03,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 22.57/9.58 [2019-03-28 12:44:03,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 22.57/9.58 [2019-03-28 12:44:03,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 22.57/9.58 [2019-03-28 12:44:03,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 22.57/9.58 [2019-03-28 12:44:03,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 22.57/9.58 [2019-03-28 12:44:03,051 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. 22.57/9.58 [2019-03-28 12:44:03,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 22.57/9.58 [2019-03-28 12:44:03,148 INFO L93 Difference]: Finished difference Result 25 states and 41 transitions. 22.57/9.58 [2019-03-28 12:44:03,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 22.57/9.58 [2019-03-28 12:44:03,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 22.57/9.58 [2019-03-28 12:44:03,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 22.57/9.58 [2019-03-28 12:44:03,162 INFO L225 Difference]: With dead ends: 25 22.57/9.58 [2019-03-28 12:44:03,162 INFO L226 Difference]: Without dead ends: 19 22.57/9.58 [2019-03-28 12:44:03,166 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 22.57/9.58 [2019-03-28 12:44:03,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. 22.57/9.58 [2019-03-28 12:44:03,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. 22.57/9.58 [2019-03-28 12:44:03,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 22.57/9.58 [2019-03-28 12:44:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. 22.57/9.58 [2019-03-28 12:44:03,202 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 29 transitions. Word has length 6 22.57/9.58 [2019-03-28 12:44:03,203 INFO L84 Accepts]: Finished accepts. word is rejected. 22.57/9.58 [2019-03-28 12:44:03,203 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 29 transitions. 22.57/9.58 [2019-03-28 12:44:03,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 22.57/9.58 [2019-03-28 12:44:03,203 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 29 transitions. 22.57/9.58 [2019-03-28 12:44:03,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 22.57/9.58 [2019-03-28 12:44:03,204 INFO L394 BasicCegarLoop]: Found error trace 22.57/9.58 [2019-03-28 12:44:03,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 22.57/9.58 [2019-03-28 12:44:03,204 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 22.57/9.58 [2019-03-28 12:44:03,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.57/9.58 [2019-03-28 12:44:03,205 INFO L82 PathProgramCache]: Analyzing trace with hash 823111809, now seen corresponding path program 1 times 22.57/9.58 [2019-03-28 12:44:03,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.57/9.58 [2019-03-28 12:44:03,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.57/9.58 [2019-03-28 12:44:03,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:03,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:03,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.57/9.58 [2019-03-28 12:44:03,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.57/9.58 [2019-03-28 12:44:03,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 22.57/9.58 [2019-03-28 12:44:03,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 22.57/9.58 [2019-03-28 12:44:03,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 22.57/9.58 [2019-03-28 12:44:03,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 22.57/9.58 [2019-03-28 12:44:03,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 22.57/9.58 [2019-03-28 12:44:03,244 INFO L87 Difference]: Start difference. First operand 19 states and 29 transitions. Second operand 4 states. 22.57/9.58 [2019-03-28 12:44:03,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 22.57/9.58 [2019-03-28 12:44:03,344 INFO L93 Difference]: Finished difference Result 37 states and 56 transitions. 22.57/9.58 [2019-03-28 12:44:03,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 22.57/9.58 [2019-03-28 12:44:03,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 22.57/9.58 [2019-03-28 12:44:03,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 22.57/9.58 [2019-03-28 12:44:03,345 INFO L225 Difference]: With dead ends: 37 22.57/9.58 [2019-03-28 12:44:03,346 INFO L226 Difference]: Without dead ends: 19 22.57/9.58 [2019-03-28 12:44:03,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 22.57/9.58 [2019-03-28 12:44:03,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. 22.57/9.58 [2019-03-28 12:44:03,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. 22.57/9.58 [2019-03-28 12:44:03,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 22.57/9.58 [2019-03-28 12:44:03,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. 22.57/9.58 [2019-03-28 12:44:03,351 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 28 transitions. Word has length 6 22.57/9.58 [2019-03-28 12:44:03,351 INFO L84 Accepts]: Finished accepts. word is rejected. 22.57/9.58 [2019-03-28 12:44:03,351 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 28 transitions. 22.57/9.58 [2019-03-28 12:44:03,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 22.57/9.58 [2019-03-28 12:44:03,351 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 28 transitions. 22.57/9.58 [2019-03-28 12:44:03,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 22.57/9.58 [2019-03-28 12:44:03,352 INFO L394 BasicCegarLoop]: Found error trace 22.57/9.58 [2019-03-28 12:44:03,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 22.57/9.58 [2019-03-28 12:44:03,352 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 22.57/9.58 [2019-03-28 12:44:03,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.57/9.58 [2019-03-28 12:44:03,353 INFO L82 PathProgramCache]: Analyzing trace with hash 841582229, now seen corresponding path program 1 times 22.57/9.58 [2019-03-28 12:44:03,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.57/9.58 [2019-03-28 12:44:03,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.57/9.58 [2019-03-28 12:44:03,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:03,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:03,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.57/9.58 [2019-03-28 12:44:03,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.57/9.58 [2019-03-28 12:44:03,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 22.57/9.58 [2019-03-28 12:44:03,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 22.57/9.58 [2019-03-28 12:44:03,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 22.57/9.58 [2019-03-28 12:44:03,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 22.57/9.58 [2019-03-28 12:44:03,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 22.57/9.58 [2019-03-28 12:44:03,400 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. Second operand 4 states. 22.57/9.58 [2019-03-28 12:44:03,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 22.57/9.58 [2019-03-28 12:44:03,485 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. 22.57/9.58 [2019-03-28 12:44:03,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 22.57/9.58 [2019-03-28 12:44:03,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 22.57/9.58 [2019-03-28 12:44:03,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 22.57/9.58 [2019-03-28 12:44:03,487 INFO L225 Difference]: With dead ends: 41 22.57/9.58 [2019-03-28 12:44:03,487 INFO L226 Difference]: Without dead ends: 35 22.57/9.58 [2019-03-28 12:44:03,488 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 22.57/9.58 [2019-03-28 12:44:03,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. 22.57/9.58 [2019-03-28 12:44:03,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. 22.57/9.58 [2019-03-28 12:44:03,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 22.57/9.58 [2019-03-28 12:44:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 44 transitions. 22.57/9.58 [2019-03-28 12:44:03,494 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 44 transitions. Word has length 6 22.57/9.58 [2019-03-28 12:44:03,494 INFO L84 Accepts]: Finished accepts. word is rejected. 22.57/9.58 [2019-03-28 12:44:03,494 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 44 transitions. 22.57/9.58 [2019-03-28 12:44:03,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 22.57/9.58 [2019-03-28 12:44:03,494 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 44 transitions. 22.57/9.58 [2019-03-28 12:44:03,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 22.57/9.58 [2019-03-28 12:44:03,495 INFO L394 BasicCegarLoop]: Found error trace 22.57/9.58 [2019-03-28 12:44:03,495 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 22.57/9.58 [2019-03-28 12:44:03,495 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 22.57/9.58 [2019-03-28 12:44:03,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.57/9.58 [2019-03-28 12:44:03,496 INFO L82 PathProgramCache]: Analyzing trace with hash 841582230, now seen corresponding path program 1 times 22.57/9.58 [2019-03-28 12:44:03,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.57/9.58 [2019-03-28 12:44:03,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.57/9.58 [2019-03-28 12:44:03,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:03,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:03,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.57/9.58 [2019-03-28 12:44:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.57/9.58 [2019-03-28 12:44:03,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 22.57/9.58 [2019-03-28 12:44:03,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 22.57/9.58 [2019-03-28 12:44:03,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 22.57/9.58 [2019-03-28 12:44:03,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 22.57/9.58 [2019-03-28 12:44:03,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 22.57/9.58 [2019-03-28 12:44:03,555 INFO L87 Difference]: Start difference. First operand 27 states and 44 transitions. Second operand 4 states. 22.57/9.58 [2019-03-28 12:44:03,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 22.57/9.58 [2019-03-28 12:44:03,638 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. 22.57/9.58 [2019-03-28 12:44:03,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 22.57/9.58 [2019-03-28 12:44:03,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 22.57/9.58 [2019-03-28 12:44:03,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 22.57/9.58 [2019-03-28 12:44:03,642 INFO L225 Difference]: With dead ends: 34 22.57/9.58 [2019-03-28 12:44:03,642 INFO L226 Difference]: Without dead ends: 28 22.57/9.58 [2019-03-28 12:44:03,643 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 22.57/9.58 [2019-03-28 12:44:03,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 22.57/9.58 [2019-03-28 12:44:03,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. 22.57/9.58 [2019-03-28 12:44:03,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 22.57/9.58 [2019-03-28 12:44:03,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. 22.57/9.58 [2019-03-28 12:44:03,649 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 6 22.57/9.58 [2019-03-28 12:44:03,649 INFO L84 Accepts]: Finished accepts. word is rejected. 22.57/9.58 [2019-03-28 12:44:03,649 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. 22.57/9.58 [2019-03-28 12:44:03,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 22.57/9.58 [2019-03-28 12:44:03,649 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. 22.57/9.58 [2019-03-28 12:44:03,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 22.57/9.58 [2019-03-28 12:44:03,650 INFO L394 BasicCegarLoop]: Found error trace 22.57/9.58 [2019-03-28 12:44:03,650 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 22.57/9.58 [2019-03-28 12:44:03,650 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 22.57/9.58 [2019-03-28 12:44:03,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.57/9.58 [2019-03-28 12:44:03,651 INFO L82 PathProgramCache]: Analyzing trace with hash 894708749, now seen corresponding path program 1 times 22.57/9.58 [2019-03-28 12:44:03,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.57/9.58 [2019-03-28 12:44:03,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.57/9.58 [2019-03-28 12:44:03,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:03,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:03,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.57/9.58 [2019-03-28 12:44:03,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.57/9.58 [2019-03-28 12:44:03,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 22.57/9.58 [2019-03-28 12:44:03,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 22.57/9.58 [2019-03-28 12:44:03,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 22.57/9.58 [2019-03-28 12:44:03,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 22.57/9.58 [2019-03-28 12:44:03,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 22.57/9.58 [2019-03-28 12:44:03,689 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 4 states. 22.57/9.58 [2019-03-28 12:44:03,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 22.57/9.58 [2019-03-28 12:44:03,766 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. 22.57/9.58 [2019-03-28 12:44:03,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 22.57/9.58 [2019-03-28 12:44:03,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 22.57/9.58 [2019-03-28 12:44:03,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 22.57/9.58 [2019-03-28 12:44:03,770 INFO L225 Difference]: With dead ends: 29 22.57/9.58 [2019-03-28 12:44:03,770 INFO L226 Difference]: Without dead ends: 0 22.57/9.58 [2019-03-28 12:44:03,770 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 22.57/9.58 [2019-03-28 12:44:03,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 22.57/9.58 [2019-03-28 12:44:03,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 22.57/9.58 [2019-03-28 12:44:03,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 22.57/9.58 [2019-03-28 12:44:03,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 22.57/9.58 [2019-03-28 12:44:03,771 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 22.57/9.58 [2019-03-28 12:44:03,772 INFO L84 Accepts]: Finished accepts. word is rejected. 22.57/9.58 [2019-03-28 12:44:03,772 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 22.57/9.58 [2019-03-28 12:44:03,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 22.57/9.58 [2019-03-28 12:44:03,772 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 22.57/9.58 [2019-03-28 12:44:03,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 22.57/9.58 [2019-03-28 12:44:03,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 22.57/9.58 [2019-03-28 12:44:03,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 22.57/9.58 [2019-03-28 12:44:03,864 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 22.57/9.58 [2019-03-28 12:44:03,865 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 21) no Hoare annotation was computed. 22.57/9.58 [2019-03-28 12:44:03,865 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 21) no Hoare annotation was computed. 22.57/9.58 [2019-03-28 12:44:03,865 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 22.57/9.58 [2019-03-28 12:44:03,865 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 22.57/9.58 [2019-03-28 12:44:03,865 INFO L448 ceAbstractionStarter]: For program point L13-2(line 13) no Hoare annotation was computed. 22.57/9.58 [2019-03-28 12:44:03,865 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. 22.57/9.58 [2019-03-28 12:44:03,865 INFO L448 ceAbstractionStarter]: For program point L13-3(line 13) no Hoare annotation was computed. 22.57/9.58 [2019-03-28 12:44:03,866 INFO L448 ceAbstractionStarter]: For program point L11-2(lines 11 14) no Hoare annotation was computed. 22.57/9.58 [2019-03-28 12:44:03,866 INFO L448 ceAbstractionStarter]: For program point L13-5(line 13) no Hoare annotation was computed. 22.57/9.58 [2019-03-28 12:44:03,866 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 22.57/9.58 [2019-03-28 12:44:03,866 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 22.57/9.58 [2019-03-28 12:44:03,866 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 22.57/9.58 [2019-03-28 12:44:03,866 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 22.57/9.58 [2019-03-28 12:44:03,866 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 22.57/9.58 [2019-03-28 12:44:03,866 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 22.57/9.58 [2019-03-28 12:44:03,867 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 22.57/9.58 [2019-03-28 12:44:03,867 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 22.57/9.58 [2019-03-28 12:44:03,867 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 22.57/9.58 [2019-03-28 12:44:03,867 INFO L448 ceAbstractionStarter]: For program point L10-2(lines 10 14) no Hoare annotation was computed. 22.57/9.58 [2019-03-28 12:44:03,868 INFO L444 ceAbstractionStarter]: At program point L10-3(lines 10 14) the Hoare annotation is: (let ((.cse4 (select |#length| ULTIMATE.start_sort_~x.base))) (let ((.cse0 (= 1 (select |#valid| ULTIMATE.start_sort_~x.base))) (.cse1 (= ULTIMATE.start_sort_~x.offset 0)) (.cse2 (<= (+ (* 4 ULTIMATE.start_sort_~n) 4) (+ .cse4 (* 4 ULTIMATE.start_sort_~pass~0)))) (.cse3 (* 4 ULTIMATE.start_sort_~i~0))) (or (and .cse0 .cse1 .cse2 (<= 4 (+ ULTIMATE.start_sort_~x.offset .cse3))) (and .cse0 (= ULTIMATE.start_sort_~i~0 0) .cse1 .cse2 (<= (+ .cse3 8) .cse4))))) 22.57/9.58 [2019-03-28 12:44:03,868 INFO L444 ceAbstractionStarter]: At program point L8-3(lines 8 14) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| ULTIMATE.start_sort_~x.base)))) (or (and .cse0 (= ULTIMATE.start_sort_~x.offset 0) (<= (+ (* 4 ULTIMATE.start_sort_~n) 4) (+ (select |#length| ULTIMATE.start_sort_~x.base) (* 4 ULTIMATE.start_sort_~pass~0)))) (and .cse0 (<= ULTIMATE.start_sort_~n ULTIMATE.start_sort_~pass~0) (<= ULTIMATE.start_main_~array_size~0 1)))) 22.57/9.58 [2019-03-28 12:44:03,868 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 22.57/9.58 [2019-03-28 12:44:03,868 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 22.57/9.58 [2019-03-28 12:44:03,868 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 22.57/9.58 [2019-03-28 12:44:03,869 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 22.57/9.58 [2019-03-28 12:44:03,878 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.57/9.58 [2019-03-28 12:44:03,885 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.57/9.58 [2019-03-28 12:44:03,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.57/9.58 [2019-03-28 12:44:03,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.57/9.58 [2019-03-28 12:44:03,888 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.57/9.58 [2019-03-28 12:44:03,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.57/9.58 [2019-03-28 12:44:03,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.57/9.58 [2019-03-28 12:44:03,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.57/9.58 [2019-03-28 12:44:03,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:44:03 BasicIcfg 22.57/9.58 [2019-03-28 12:44:03,892 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 22.57/9.58 [2019-03-28 12:44:03,892 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 22.57/9.58 [2019-03-28 12:44:03,892 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 22.57/9.58 [2019-03-28 12:44:03,896 INFO L276 PluginConnector]: BuchiAutomizer initialized 22.57/9.58 [2019-03-28 12:44:03,897 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 22.57/9.58 [2019-03-28 12:44:03,897 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:44:01" (1/5) ... 22.57/9.58 [2019-03-28 12:44:03,897 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59336057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:44:03, skipping insertion in model container 22.57/9.58 [2019-03-28 12:44:03,897 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 22.57/9.58 [2019-03-28 12:44:03,898 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02" (2/5) ... 22.57/9.58 [2019-03-28 12:44:03,898 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59336057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:44:03, skipping insertion in model container 22.57/9.58 [2019-03-28 12:44:03,898 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 22.57/9.58 [2019-03-28 12:44:03,898 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:02" (3/5) ... 22.57/9.58 [2019-03-28 12:44:03,899 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59336057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:03, skipping insertion in model container 22.57/9.58 [2019-03-28 12:44:03,899 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 22.57/9.58 [2019-03-28 12:44:03,899 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:44:02" (4/5) ... 22.57/9.58 [2019-03-28 12:44:03,899 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59336057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:03, skipping insertion in model container 22.57/9.58 [2019-03-28 12:44:03,899 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 22.57/9.58 [2019-03-28 12:44:03,899 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:44:03" (5/5) ... 22.57/9.58 [2019-03-28 12:44:03,901 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 22.57/9.58 [2019-03-28 12:44:03,923 INFO L133 ementStrategyFactory]: Using default assertion order modulation 22.57/9.58 [2019-03-28 12:44:03,923 INFO L374 BuchiCegarLoop]: Interprodecural is true 22.57/9.58 [2019-03-28 12:44:03,923 INFO L375 BuchiCegarLoop]: Hoare is true 22.57/9.58 [2019-03-28 12:44:03,923 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 22.57/9.58 [2019-03-28 12:44:03,923 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 22.57/9.58 [2019-03-28 12:44:03,923 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 22.57/9.58 [2019-03-28 12:44:03,923 INFO L379 BuchiCegarLoop]: Difference is false 22.57/9.58 [2019-03-28 12:44:03,924 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 22.57/9.58 [2019-03-28 12:44:03,924 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 22.57/9.58 [2019-03-28 12:44:04,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. 22.57/9.58 [2019-03-28 12:44:04,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 22.57/9.58 [2019-03-28 12:44:04,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.57/9.58 [2019-03-28 12:44:04,027 INFO L119 BuchiIsEmpty]: Starting construction of run 22.57/9.58 [2019-03-28 12:44:04,032 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 22.57/9.58 [2019-03-28 12:44:04,032 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 22.57/9.58 [2019-03-28 12:44:04,032 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 22.57/9.58 [2019-03-28 12:44:04,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. 22.57/9.58 [2019-03-28 12:44:04,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 22.57/9.58 [2019-03-28 12:44:04,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.57/9.58 [2019-03-28 12:44:04,035 INFO L119 BuchiIsEmpty]: Starting construction of run 22.57/9.58 [2019-03-28 12:44:04,035 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 22.57/9.58 [2019-03-28 12:44:04,035 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 22.57/9.58 [2019-03-28 12:44:04,041 INFO L794 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue [145] ULTIMATE.startENTRY-->L19: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 18#L19true [102] L19-->L19-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 15#L19-2true [120] L19-2-->L8-3: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_sort_~x.base_1 |v_ULTIMATE.start_sort_#in~x.base_1|) (= |v_ULTIMATE.start_sort_#in~x.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= |v_ULTIMATE.start_sort_#in~x.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_sort_~n_1 |v_ULTIMATE.start_sort_#in~n_1|) (= |v_ULTIMATE.start_sort_#in~n_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_sort_~x.offset_1 |v_ULTIMATE.start_sort_#in~x.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (= v_ULTIMATE.start_sort_~pass~0_1 1)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_1, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_1, ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_1, ULTIMATE.start_sort_#t~post1=|v_ULTIMATE.start_sort_#t~post1_1|, ULTIMATE.start_sort_#in~x.base=|v_ULTIMATE.start_sort_#in~x.base_1|, ULTIMATE.start_sort_#in~n=|v_ULTIMATE.start_sort_#in~n_1|, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_1, ULTIMATE.start_sort_#t~post0=|v_ULTIMATE.start_sort_#t~post0_1|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_sort_~temp~0=v_ULTIMATE.start_sort_~temp~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_sort_#t~mem5=|v_ULTIMATE.start_sort_#t~mem5_1|, ULTIMATE.start_sort_#t~mem4=|v_ULTIMATE.start_sort_#t~mem4_1|, #length=|v_#length_1|, ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_1|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_1|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_1, ULTIMATE.start_sort_#in~x.offset=|v_ULTIMATE.start_sort_#in~x.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_sort_~x.offset, ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_#t~post1, ULTIMATE.start_sort_#in~x.base, ULTIMATE.start_sort_#in~n, ULTIMATE.start_sort_~n, ULTIMATE.start_sort_#t~post0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_sort_~temp~0, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_sort_#t~mem5, ULTIMATE.start_sort_#t~mem4, #length, ULTIMATE.start_sort_#t~mem3, ULTIMATE.start_sort_#t~mem2, ULTIMATE.start_sort_~x.base, ULTIMATE.start_sort_#in~x.offset] 14#L8-3true 22.57/9.58 [2019-03-28 12:44:04,041 INFO L796 eck$LassoCheckResult]: Loop: 14#L8-3true [75] L8-3-->L10-3: Formula: (and (= v_ULTIMATE.start_sort_~i~0_3 0) (< v_ULTIMATE.start_sort_~pass~0_5 v_ULTIMATE.start_sort_~n_4)) InVars {ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_5, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_4} OutVars{ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_5, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_4, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_3} AuxVars[] AssignedVars[ULTIMATE.start_sort_~i~0] 16#L10-3true [147] L10-3-->L8-3: Formula: (and (<= v_ULTIMATE.start_sort_~n_8 (+ v_ULTIMATE.start_sort_~pass~0_12 v_ULTIMATE.start_sort_~i~0_20)) (= (+ v_ULTIMATE.start_sort_~pass~0_12 1) v_ULTIMATE.start_sort_~pass~0_11)) InVars {ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_20, ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_12, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_8} OutVars{ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_20, ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_11, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_8, ULTIMATE.start_sort_#t~post0=|v_ULTIMATE.start_sort_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_#t~post0] 14#L8-3true 22.57/9.58 [2019-03-28 12:44:04,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.57/9.58 [2019-03-28 12:44:04,042 INFO L82 PathProgramCache]: Analyzing trace with hash 172418, now seen corresponding path program 1 times 22.57/9.58 [2019-03-28 12:44:04,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.57/9.58 [2019-03-28 12:44:04,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.57/9.58 [2019-03-28 12:44:04,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:04,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:04,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.57/9.58 [2019-03-28 12:44:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.57/9.58 [2019-03-28 12:44:04,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.57/9.58 [2019-03-28 12:44:04,076 INFO L82 PathProgramCache]: Analyzing trace with hash 3433, now seen corresponding path program 1 times 22.57/9.58 [2019-03-28 12:44:04,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.57/9.58 [2019-03-28 12:44:04,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.57/9.58 [2019-03-28 12:44:04,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:04,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:04,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.57/9.58 [2019-03-28 12:44:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.57/9.58 [2019-03-28 12:44:04,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 22.57/9.58 [2019-03-28 12:44:04,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 22.57/9.58 [2019-03-28 12:44:04,088 INFO L811 eck$LassoCheckResult]: loop already infeasible 22.57/9.58 [2019-03-28 12:44:04,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 22.57/9.58 [2019-03-28 12:44:04,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 22.57/9.58 [2019-03-28 12:44:04,090 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. 22.57/9.58 [2019-03-28 12:44:04,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 22.57/9.58 [2019-03-28 12:44:04,145 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. 22.57/9.58 [2019-03-28 12:44:04,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 22.57/9.58 [2019-03-28 12:44:04,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 42 transitions. 22.57/9.58 [2019-03-28 12:44:04,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 22.57/9.58 [2019-03-28 12:44:04,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 14 states and 18 transitions. 22.57/9.58 [2019-03-28 12:44:04,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 22.57/9.58 [2019-03-28 12:44:04,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 22.57/9.58 [2019-03-28 12:44:04,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. 22.57/9.58 [2019-03-28 12:44:04,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 22.57/9.58 [2019-03-28 12:44:04,153 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. 22.57/9.58 [2019-03-28 12:44:04,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. 22.57/9.58 [2019-03-28 12:44:04,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. 22.57/9.58 [2019-03-28 12:44:04,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 22.57/9.58 [2019-03-28 12:44:04,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. 22.57/9.58 [2019-03-28 12:44:04,156 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. 22.57/9.58 [2019-03-28 12:44:04,156 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. 22.57/9.58 [2019-03-28 12:44:04,156 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 22.57/9.58 [2019-03-28 12:44:04,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. 22.57/9.58 [2019-03-28 12:44:04,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 22.57/9.58 [2019-03-28 12:44:04,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.57/9.58 [2019-03-28 12:44:04,157 INFO L119 BuchiIsEmpty]: Starting construction of run 22.57/9.58 [2019-03-28 12:44:04,158 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 22.57/9.58 [2019-03-28 12:44:04,158 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 22.57/9.58 [2019-03-28 12:44:04,158 INFO L794 eck$LassoCheckResult]: Stem: 72#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L19: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 67#L19 [102] L19-->L19-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 62#L19-2 [120] L19-2-->L8-3: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_sort_~x.base_1 |v_ULTIMATE.start_sort_#in~x.base_1|) (= |v_ULTIMATE.start_sort_#in~x.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= |v_ULTIMATE.start_sort_#in~x.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_sort_~n_1 |v_ULTIMATE.start_sort_#in~n_1|) (= |v_ULTIMATE.start_sort_#in~n_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_sort_~x.offset_1 |v_ULTIMATE.start_sort_#in~x.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (= v_ULTIMATE.start_sort_~pass~0_1 1)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_1, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_1, ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_1, ULTIMATE.start_sort_#t~post1=|v_ULTIMATE.start_sort_#t~post1_1|, ULTIMATE.start_sort_#in~x.base=|v_ULTIMATE.start_sort_#in~x.base_1|, ULTIMATE.start_sort_#in~n=|v_ULTIMATE.start_sort_#in~n_1|, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_1, ULTIMATE.start_sort_#t~post0=|v_ULTIMATE.start_sort_#t~post0_1|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_sort_~temp~0=v_ULTIMATE.start_sort_~temp~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_sort_#t~mem5=|v_ULTIMATE.start_sort_#t~mem5_1|, ULTIMATE.start_sort_#t~mem4=|v_ULTIMATE.start_sort_#t~mem4_1|, #length=|v_#length_1|, ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_1|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_1|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_1, ULTIMATE.start_sort_#in~x.offset=|v_ULTIMATE.start_sort_#in~x.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_sort_~x.offset, ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_#t~post1, ULTIMATE.start_sort_#in~x.base, ULTIMATE.start_sort_#in~n, ULTIMATE.start_sort_~n, ULTIMATE.start_sort_#t~post0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_sort_~temp~0, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_sort_#t~mem5, ULTIMATE.start_sort_#t~mem4, #length, ULTIMATE.start_sort_#t~mem3, ULTIMATE.start_sort_#t~mem2, ULTIMATE.start_sort_~x.base, ULTIMATE.start_sort_#in~x.offset] 60#L8-3 22.57/9.58 [2019-03-28 12:44:04,159 INFO L796 eck$LassoCheckResult]: Loop: 60#L8-3 [75] L8-3-->L10-3: Formula: (and (= v_ULTIMATE.start_sort_~i~0_3 0) (< v_ULTIMATE.start_sort_~pass~0_5 v_ULTIMATE.start_sort_~n_4)) InVars {ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_5, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_4} OutVars{ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_5, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_4, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_3} AuxVars[] AssignedVars[ULTIMATE.start_sort_~i~0] 61#L10-3 [80] L10-3-->L11: Formula: (< (+ v_ULTIMATE.start_sort_~pass~0_7 v_ULTIMATE.start_sort_~i~0_5) v_ULTIMATE.start_sort_~n_6) InVars {ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_7, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_6, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_5} OutVars{ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_7, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_6, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_5} AuxVars[] AssignedVars[] 63#L11 [91] L11-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_sort_~i~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_sort_~x.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_sort_~x.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_sort_~x.base_3)) (= |v_ULTIMATE.start_sort_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_sort_~x.base_3) .cse0)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_sort_~x.base_3))))) InVars {ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_3, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_6, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_3} OutVars{ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_3, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_6, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_2|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_3} AuxVars[] AssignedVars[ULTIMATE.start_sort_#t~mem2] 70#L11-1 [84] L11-1-->L11-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_sort_~i~0_8))) (let ((.cse1 (+ v_ULTIMATE.start_sort_~x.offset_5 .cse0 4))) (and (<= (+ v_ULTIMATE.start_sort_~x.offset_5 .cse0 8) (select |v_#length_5| v_ULTIMATE.start_sort_~x.base_6)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_sort_~x.base_6)) (<= 0 .cse1) (= |v_ULTIMATE.start_sort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_sort_~x.base_6) .cse1))))) InVars {ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_5, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_8, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_6} OutVars{ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_5, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_8, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_2|, #length=|v_#length_5|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_6} AuxVars[] AssignedVars[ULTIMATE.start_sort_#t~mem3] 68#L11-2 [110] L11-2-->L10-2: Formula: (>= |v_ULTIMATE.start_sort_#t~mem3_6| |v_ULTIMATE.start_sort_#t~mem2_6|) InVars {ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_6|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_6|} OutVars{ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_5|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_sort_#t~mem3, ULTIMATE.start_sort_#t~mem2] 64#L10-2 [81] L10-2-->L10-3: Formula: (= v_ULTIMATE.start_sort_~i~0_18 (+ v_ULTIMATE.start_sort_~i~0_19 1)) InVars {ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_19} OutVars{ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_18, ULTIMATE.start_sort_#t~post1=|v_ULTIMATE.start_sort_#t~post1_2|} AuxVars[] AssignedVars[ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_#t~post1] 65#L10-3 [147] L10-3-->L8-3: Formula: (and (<= v_ULTIMATE.start_sort_~n_8 (+ v_ULTIMATE.start_sort_~pass~0_12 v_ULTIMATE.start_sort_~i~0_20)) (= (+ v_ULTIMATE.start_sort_~pass~0_12 1) v_ULTIMATE.start_sort_~pass~0_11)) InVars {ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_20, ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_12, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_8} OutVars{ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_20, ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_11, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_8, ULTIMATE.start_sort_#t~post0=|v_ULTIMATE.start_sort_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_#t~post0] 60#L8-3 22.57/9.58 [2019-03-28 12:44:04,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.57/9.58 [2019-03-28 12:44:04,159 INFO L82 PathProgramCache]: Analyzing trace with hash 172418, now seen corresponding path program 2 times 22.57/9.58 [2019-03-28 12:44:04,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.57/9.58 [2019-03-28 12:44:04,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.57/9.58 [2019-03-28 12:44:04,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:04,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:04,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.57/9.58 [2019-03-28 12:44:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.57/9.58 [2019-03-28 12:44:04,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.57/9.58 [2019-03-28 12:44:04,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1963092977, now seen corresponding path program 1 times 22.57/9.58 [2019-03-28 12:44:04,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.57/9.58 [2019-03-28 12:44:04,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.57/9.58 [2019-03-28 12:44:04,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:04,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:04,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.57/9.58 [2019-03-28 12:44:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.57/9.58 [2019-03-28 12:44:04,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.57/9.58 [2019-03-28 12:44:04,189 INFO L82 PathProgramCache]: Analyzing trace with hash -999274672, now seen corresponding path program 1 times 22.57/9.58 [2019-03-28 12:44:04,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.57/9.58 [2019-03-28 12:44:04,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.57/9.58 [2019-03-28 12:44:04,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:04,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:04,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.57/9.58 [2019-03-28 12:44:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.57/9.58 [2019-03-28 12:44:04,419 INFO L216 LassoAnalysis]: Preferences: 22.57/9.58 [2019-03-28 12:44:04,420 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 22.57/9.58 [2019-03-28 12:44:04,420 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 22.57/9.58 [2019-03-28 12:44:04,421 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 22.57/9.58 [2019-03-28 12:44:04,421 INFO L127 ssoRankerPreferences]: Use exernal solver: false 22.57/9.58 [2019-03-28 12:44:04,421 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 22.57/9.58 [2019-03-28 12:44:04,421 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 22.57/9.58 [2019-03-28 12:44:04,421 INFO L130 ssoRankerPreferences]: Path of dumped script: 22.57/9.58 [2019-03-28 12:44:04,421 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 22.57/9.58 [2019-03-28 12:44:04,422 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 22.57/9.58 [2019-03-28 12:44:04,422 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 22.57/9.58 [2019-03-28 12:44:04,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:04,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:04,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:04,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:04,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:04,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:04,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:04,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:04,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:04,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:04,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:04,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:04,875 INFO L300 LassoAnalysis]: Preprocessing complete. 22.57/9.58 [2019-03-28 12:44:04,881 INFO L497 LassoAnalysis]: Using template 'affine'. 22.57/9.58 [2019-03-28 12:44:04,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.57/9.58 Termination analysis: LINEAR_WITH_GUESSES 22.57/9.58 Number of strict supporting invariants: 0 22.57/9.58 Number of non-strict supporting invariants: 1 22.57/9.58 Consider only non-deceasing supporting invariants: true 22.57/9.58 Simplify termination arguments: true 22.57/9.58 Simplify supporting invariants: trueOverapproximate stem: false 22.57/9.58 [2019-03-28 12:44:04,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.57/9.58 [2019-03-28 12:44:04,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.57/9.58 [2019-03-28 12:44:04,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.57/9.58 [2019-03-28 12:44:04,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.57/9.58 [2019-03-28 12:44:04,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.57/9.58 [2019-03-28 12:44:04,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.57/9.58 [2019-03-28 12:44:04,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.57/9.58 [2019-03-28 12:44:04,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.57/9.58 [2019-03-28 12:44:04,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.57/9.58 Termination analysis: LINEAR_WITH_GUESSES 22.57/9.58 Number of strict supporting invariants: 0 22.57/9.58 Number of non-strict supporting invariants: 1 22.57/9.58 Consider only non-deceasing supporting invariants: true 22.57/9.58 Simplify termination arguments: true 22.57/9.58 Simplify supporting invariants: trueOverapproximate stem: false 22.57/9.58 [2019-03-28 12:44:04,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.57/9.58 [2019-03-28 12:44:04,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.57/9.58 [2019-03-28 12:44:04,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.57/9.58 [2019-03-28 12:44:04,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.57/9.58 [2019-03-28 12:44:04,894 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 22.57/9.58 [2019-03-28 12:44:04,894 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 22.57/9.58 [2019-03-28 12:44:04,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.57/9.58 [2019-03-28 12:44:04,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.57/9.58 Termination analysis: LINEAR_WITH_GUESSES 22.57/9.58 Number of strict supporting invariants: 0 22.57/9.58 Number of non-strict supporting invariants: 1 22.57/9.58 Consider only non-deceasing supporting invariants: true 22.57/9.58 Simplify termination arguments: true 22.57/9.58 Simplify supporting invariants: trueOverapproximate stem: false 22.57/9.58 [2019-03-28 12:44:04,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.57/9.58 [2019-03-28 12:44:04,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.57/9.58 [2019-03-28 12:44:04,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.57/9.58 [2019-03-28 12:44:04,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.57/9.58 [2019-03-28 12:44:04,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 22.57/9.58 [2019-03-28 12:44:04,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 22.57/9.58 [2019-03-28 12:44:04,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.57/9.58 [2019-03-28 12:44:04,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.57/9.58 Termination analysis: LINEAR_WITH_GUESSES 22.57/9.58 Number of strict supporting invariants: 0 22.57/9.58 Number of non-strict supporting invariants: 1 22.57/9.58 Consider only non-deceasing supporting invariants: true 22.57/9.58 Simplify termination arguments: true 22.57/9.58 Simplify supporting invariants: trueOverapproximate stem: false 22.57/9.58 [2019-03-28 12:44:04,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.57/9.58 [2019-03-28 12:44:04,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.57/9.58 [2019-03-28 12:44:04,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.57/9.58 [2019-03-28 12:44:04,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.57/9.58 [2019-03-28 12:44:04,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 22.57/9.58 [2019-03-28 12:44:04,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 22.57/9.58 [2019-03-28 12:44:04,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.57/9.58 [2019-03-28 12:44:04,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.57/9.58 Termination analysis: LINEAR_WITH_GUESSES 22.57/9.58 Number of strict supporting invariants: 0 22.57/9.58 Number of non-strict supporting invariants: 1 22.57/9.58 Consider only non-deceasing supporting invariants: true 22.57/9.58 Simplify termination arguments: true 22.57/9.58 Simplify supporting invariants: trueOverapproximate stem: false 22.57/9.58 [2019-03-28 12:44:04,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.57/9.58 [2019-03-28 12:44:04,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.57/9.58 [2019-03-28 12:44:04,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.57/9.58 [2019-03-28 12:44:04,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.57/9.58 [2019-03-28 12:44:04,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 22.57/9.58 [2019-03-28 12:44:04,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 22.57/9.58 [2019-03-28 12:44:04,979 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 22.57/9.58 [2019-03-28 12:44:05,018 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 22.57/9.58 [2019-03-28 12:44:05,018 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. 22.57/9.58 [2019-03-28 12:44:05,021 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 22.57/9.58 [2019-03-28 12:44:05,022 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 22.57/9.58 [2019-03-28 12:44:05,022 INFO L518 LassoAnalysis]: Proved termination. 22.57/9.58 [2019-03-28 12:44:05,023 INFO L520 LassoAnalysis]: Termination argument consisting of: 22.57/9.58 Ranking function f(ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n 22.57/9.58 Supporting invariants [] 22.57/9.58 [2019-03-28 12:44:05,035 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed 22.57/9.58 [2019-03-28 12:44:05,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.57/9.58 [2019-03-28 12:44:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.57/9.58 [2019-03-28 12:44:05,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core 22.57/9.58 [2019-03-28 12:44:05,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.57/9.58 [2019-03-28 12:44:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.57/9.58 [2019-03-28 12:44:05,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core 22.57/9.58 [2019-03-28 12:44:05,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.57/9.58 [2019-03-28 12:44:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 22.57/9.58 [2019-03-28 12:44:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.57/9.58 [2019-03-28 12:44:05,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core 22.57/9.58 [2019-03-28 12:44:05,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.57/9.58 [2019-03-28 12:44:05,207 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 22.57/9.58 [2019-03-28 12:44:05,211 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 22.57/9.58 [2019-03-28 12:44:05,212 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand 3 states. 22.57/9.58 [2019-03-28 12:44:05,250 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 18 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 36 states and 45 transitions. Complement of second has 4 states. 22.57/9.58 [2019-03-28 12:44:05,250 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 22.57/9.58 [2019-03-28 12:44:05,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 22.57/9.58 [2019-03-28 12:44:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. 22.57/9.58 [2019-03-28 12:44:05,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 3 letters. Loop has 7 letters. 22.57/9.58 [2019-03-28 12:44:05,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.57/9.58 [2019-03-28 12:44:05,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 10 letters. Loop has 7 letters. 22.57/9.58 [2019-03-28 12:44:05,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.57/9.58 [2019-03-28 12:44:05,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 3 letters. Loop has 14 letters. 22.57/9.58 [2019-03-28 12:44:05,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.57/9.58 [2019-03-28 12:44:05,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. 22.57/9.58 [2019-03-28 12:44:05,263 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 22.57/9.58 [2019-03-28 12:44:05,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 45 transitions. 22.57/9.58 [2019-03-28 12:44:05,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 22.57/9.58 [2019-03-28 12:44:05,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 22.57/9.58 [2019-03-28 12:44:05,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. 22.57/9.58 [2019-03-28 12:44:05,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 22.57/9.58 [2019-03-28 12:44:05,265 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. 22.57/9.58 [2019-03-28 12:44:05,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. 22.57/9.58 [2019-03-28 12:44:05,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. 22.57/9.58 [2019-03-28 12:44:05,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. 22.57/9.58 [2019-03-28 12:44:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. 22.57/9.58 [2019-03-28 12:44:05,267 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. 22.57/9.58 [2019-03-28 12:44:05,268 INFO L609 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. 22.57/9.58 [2019-03-28 12:44:05,268 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 22.57/9.58 [2019-03-28 12:44:05,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 44 transitions. 22.57/9.58 [2019-03-28 12:44:05,269 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 22.57/9.58 [2019-03-28 12:44:05,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.57/9.58 [2019-03-28 12:44:05,269 INFO L119 BuchiIsEmpty]: Starting construction of run 22.57/9.58 [2019-03-28 12:44:05,269 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 22.57/9.58 [2019-03-28 12:44:05,269 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 22.57/9.58 [2019-03-28 12:44:05,270 INFO L794 eck$LassoCheckResult]: Stem: 220#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L19: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 211#L19 [102] L19-->L19-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 202#L19-2 [119] L19-2-->L8-3: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_sort_~x.base_1 |v_ULTIMATE.start_sort_#in~x.base_1|) (= |v_ULTIMATE.start_sort_#in~x.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= |v_ULTIMATE.start_sort_#in~x.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_sort_~n_1 |v_ULTIMATE.start_sort_#in~n_1|) (= |v_ULTIMATE.start_sort_#in~n_1| v_ULTIMATE.start_main_~array_size~0_7) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= v_ULTIMATE.start_sort_~x.offset_1 |v_ULTIMATE.start_sort_#in~x.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (= v_ULTIMATE.start_sort_~pass~0_1 1)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_1, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_1, ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_1, ULTIMATE.start_sort_#t~post1=|v_ULTIMATE.start_sort_#t~post1_1|, ULTIMATE.start_sort_#in~x.base=|v_ULTIMATE.start_sort_#in~x.base_1|, ULTIMATE.start_sort_#in~n=|v_ULTIMATE.start_sort_#in~n_1|, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_1, ULTIMATE.start_sort_#t~post0=|v_ULTIMATE.start_sort_#t~post0_1|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_sort_~temp~0=v_ULTIMATE.start_sort_~temp~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_sort_#t~mem5=|v_ULTIMATE.start_sort_#t~mem5_1|, ULTIMATE.start_sort_#t~mem4=|v_ULTIMATE.start_sort_#t~mem4_1|, #length=|v_#length_1|, ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_1|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_1|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_1, ULTIMATE.start_sort_#in~x.offset=|v_ULTIMATE.start_sort_#in~x.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_sort_~x.offset, ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_#t~post1, ULTIMATE.start_sort_#in~x.base, ULTIMATE.start_sort_#in~n, ULTIMATE.start_sort_~n, ULTIMATE.start_sort_#t~post0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_sort_~temp~0, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_sort_#t~mem5, ULTIMATE.start_sort_#t~mem4, #length, ULTIMATE.start_sort_#t~mem3, ULTIMATE.start_sort_#t~mem2, ULTIMATE.start_sort_~x.base, ULTIMATE.start_sort_#in~x.offset] 197#L8-3 22.57/9.58 [2019-03-28 12:44:05,270 INFO L796 eck$LassoCheckResult]: Loop: 197#L8-3 [75] L8-3-->L10-3: Formula: (and (= v_ULTIMATE.start_sort_~i~0_3 0) (< v_ULTIMATE.start_sort_~pass~0_5 v_ULTIMATE.start_sort_~n_4)) InVars {ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_5, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_4} OutVars{ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_5, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_4, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_3} AuxVars[] AssignedVars[ULTIMATE.start_sort_~i~0] 198#L10-3 [80] L10-3-->L11: Formula: (< (+ v_ULTIMATE.start_sort_~pass~0_7 v_ULTIMATE.start_sort_~i~0_5) v_ULTIMATE.start_sort_~n_6) InVars {ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_7, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_6, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_5} OutVars{ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_7, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_6, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_5} AuxVars[] AssignedVars[] 224#L11 [91] L11-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_sort_~i~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_sort_~x.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_sort_~x.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_sort_~x.base_3)) (= |v_ULTIMATE.start_sort_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_sort_~x.base_3) .cse0)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_sort_~x.base_3))))) InVars {ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_3, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_6, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_3} OutVars{ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_3, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_6, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_2|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_3} AuxVars[] AssignedVars[ULTIMATE.start_sort_#t~mem2] 229#L11-1 [84] L11-1-->L11-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_sort_~i~0_8))) (let ((.cse1 (+ v_ULTIMATE.start_sort_~x.offset_5 .cse0 4))) (and (<= (+ v_ULTIMATE.start_sort_~x.offset_5 .cse0 8) (select |v_#length_5| v_ULTIMATE.start_sort_~x.base_6)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_sort_~x.base_6)) (<= 0 .cse1) (= |v_ULTIMATE.start_sort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_sort_~x.base_6) .cse1))))) InVars {ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_5, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_8, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_6} OutVars{ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_5, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_8, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_2|, #length=|v_#length_5|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_6} AuxVars[] AssignedVars[ULTIMATE.start_sort_#t~mem3] 227#L11-2 [110] L11-2-->L10-2: Formula: (>= |v_ULTIMATE.start_sort_#t~mem3_6| |v_ULTIMATE.start_sort_#t~mem2_6|) InVars {ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_6|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_6|} OutVars{ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_5|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_sort_#t~mem3, ULTIMATE.start_sort_#t~mem2] 225#L10-2 [81] L10-2-->L10-3: Formula: (= v_ULTIMATE.start_sort_~i~0_18 (+ v_ULTIMATE.start_sort_~i~0_19 1)) InVars {ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_19} OutVars{ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_18, ULTIMATE.start_sort_#t~post1=|v_ULTIMATE.start_sort_#t~post1_2|} AuxVars[] AssignedVars[ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_#t~post1] 223#L10-3 [147] L10-3-->L8-3: Formula: (and (<= v_ULTIMATE.start_sort_~n_8 (+ v_ULTIMATE.start_sort_~pass~0_12 v_ULTIMATE.start_sort_~i~0_20)) (= (+ v_ULTIMATE.start_sort_~pass~0_12 1) v_ULTIMATE.start_sort_~pass~0_11)) InVars {ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_20, ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_12, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_8} OutVars{ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_20, ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_11, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_8, ULTIMATE.start_sort_#t~post0=|v_ULTIMATE.start_sort_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_#t~post0] 197#L8-3 22.57/9.58 [2019-03-28 12:44:05,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.57/9.58 [2019-03-28 12:44:05,271 INFO L82 PathProgramCache]: Analyzing trace with hash 172417, now seen corresponding path program 1 times 22.57/9.58 [2019-03-28 12:44:05,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.57/9.58 [2019-03-28 12:44:05,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.57/9.58 [2019-03-28 12:44:05,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:05,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:05,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.57/9.58 [2019-03-28 12:44:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.57/9.58 [2019-03-28 12:44:05,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.57/9.58 [2019-03-28 12:44:05,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1963092977, now seen corresponding path program 2 times 22.57/9.58 [2019-03-28 12:44:05,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.57/9.58 [2019-03-28 12:44:05,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.57/9.58 [2019-03-28 12:44:05,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:05,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:05,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.57/9.58 [2019-03-28 12:44:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.57/9.58 [2019-03-28 12:44:05,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.57/9.58 [2019-03-28 12:44:05,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1552882289, now seen corresponding path program 1 times 22.57/9.58 [2019-03-28 12:44:05,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.57/9.58 [2019-03-28 12:44:05,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.57/9.58 [2019-03-28 12:44:05,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:05,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:05,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.57/9.58 [2019-03-28 12:44:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.57/9.58 [2019-03-28 12:44:05,489 INFO L216 LassoAnalysis]: Preferences: 22.57/9.58 [2019-03-28 12:44:05,490 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 22.57/9.58 [2019-03-28 12:44:05,490 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 22.57/9.58 [2019-03-28 12:44:05,490 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 22.57/9.58 [2019-03-28 12:44:05,490 INFO L127 ssoRankerPreferences]: Use exernal solver: false 22.57/9.58 [2019-03-28 12:44:05,490 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 22.57/9.58 [2019-03-28 12:44:05,490 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 22.57/9.58 [2019-03-28 12:44:05,490 INFO L130 ssoRankerPreferences]: Path of dumped script: 22.57/9.58 [2019-03-28 12:44:05,491 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 22.57/9.58 [2019-03-28 12:44:05,491 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 22.57/9.58 [2019-03-28 12:44:05,491 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 22.57/9.58 [2019-03-28 12:44:05,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:05,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:05,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:05,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:05,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:05,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:05,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:05,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:05,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:05,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:05,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:05,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:05,864 INFO L300 LassoAnalysis]: Preprocessing complete. 22.57/9.58 [2019-03-28 12:44:05,864 INFO L497 LassoAnalysis]: Using template 'affine'. 22.57/9.58 [2019-03-28 12:44:05,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.57/9.58 Termination analysis: LINEAR_WITH_GUESSES 22.57/9.58 Number of strict supporting invariants: 0 22.57/9.58 Number of non-strict supporting invariants: 1 22.57/9.58 Consider only non-deceasing supporting invariants: true 22.57/9.58 Simplify termination arguments: true 22.57/9.58 Simplify supporting invariants: trueOverapproximate stem: false 22.57/9.58 [2019-03-28 12:44:05,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.57/9.58 [2019-03-28 12:44:05,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.57/9.58 [2019-03-28 12:44:05,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.57/9.58 [2019-03-28 12:44:05,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.57/9.58 [2019-03-28 12:44:05,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.57/9.58 [2019-03-28 12:44:05,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.57/9.58 [2019-03-28 12:44:05,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.57/9.58 [2019-03-28 12:44:05,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.57/9.58 [2019-03-28 12:44:05,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.57/9.58 Termination analysis: LINEAR_WITH_GUESSES 22.57/9.58 Number of strict supporting invariants: 0 22.57/9.58 Number of non-strict supporting invariants: 1 22.57/9.58 Consider only non-deceasing supporting invariants: true 22.57/9.58 Simplify termination arguments: true 22.57/9.58 Simplify supporting invariants: trueOverapproximate stem: false 22.57/9.58 [2019-03-28 12:44:05,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.57/9.58 [2019-03-28 12:44:05,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.57/9.58 [2019-03-28 12:44:05,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.57/9.58 [2019-03-28 12:44:05,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.57/9.58 [2019-03-28 12:44:05,870 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 22.57/9.58 [2019-03-28 12:44:05,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 22.57/9.58 [2019-03-28 12:44:05,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.57/9.58 [2019-03-28 12:44:05,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.57/9.58 Termination analysis: LINEAR_WITH_GUESSES 22.57/9.58 Number of strict supporting invariants: 0 22.57/9.58 Number of non-strict supporting invariants: 1 22.57/9.58 Consider only non-deceasing supporting invariants: true 22.57/9.58 Simplify termination arguments: true 22.57/9.58 Simplify supporting invariants: trueOverapproximate stem: false 22.57/9.58 [2019-03-28 12:44:05,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.57/9.58 [2019-03-28 12:44:05,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.57/9.58 [2019-03-28 12:44:05,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.57/9.58 [2019-03-28 12:44:05,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.57/9.58 [2019-03-28 12:44:05,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.57/9.58 [2019-03-28 12:44:05,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.57/9.58 [2019-03-28 12:44:05,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.57/9.58 [2019-03-28 12:44:05,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.57/9.58 [2019-03-28 12:44:05,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.57/9.58 Termination analysis: LINEAR_WITH_GUESSES 22.57/9.58 Number of strict supporting invariants: 0 22.57/9.58 Number of non-strict supporting invariants: 1 22.57/9.58 Consider only non-deceasing supporting invariants: true 22.57/9.58 Simplify termination arguments: true 22.57/9.58 Simplify supporting invariants: trueOverapproximate stem: false 22.57/9.58 [2019-03-28 12:44:05,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.57/9.58 [2019-03-28 12:44:05,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.57/9.58 [2019-03-28 12:44:05,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.57/9.58 [2019-03-28 12:44:05,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.57/9.58 [2019-03-28 12:44:05,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.57/9.58 [2019-03-28 12:44:05,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.57/9.58 [2019-03-28 12:44:05,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.57/9.58 [2019-03-28 12:44:05,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.57/9.58 [2019-03-28 12:44:05,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.57/9.58 Termination analysis: LINEAR_WITH_GUESSES 22.57/9.58 Number of strict supporting invariants: 0 22.57/9.58 Number of non-strict supporting invariants: 1 22.57/9.58 Consider only non-deceasing supporting invariants: true 22.57/9.58 Simplify termination arguments: true 22.57/9.58 Simplify supporting invariants: trueOverapproximate stem: false 22.57/9.58 [2019-03-28 12:44:05,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.57/9.58 [2019-03-28 12:44:05,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.57/9.58 [2019-03-28 12:44:05,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.57/9.58 [2019-03-28 12:44:05,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.57/9.58 [2019-03-28 12:44:05,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.57/9.58 [2019-03-28 12:44:05,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.57/9.58 [2019-03-28 12:44:05,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.57/9.58 [2019-03-28 12:44:05,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.57/9.58 [2019-03-28 12:44:05,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.57/9.58 Termination analysis: LINEAR_WITH_GUESSES 22.57/9.58 Number of strict supporting invariants: 0 22.57/9.58 Number of non-strict supporting invariants: 1 22.57/9.58 Consider only non-deceasing supporting invariants: true 22.57/9.58 Simplify termination arguments: true 22.57/9.58 Simplify supporting invariants: trueOverapproximate stem: false 22.57/9.58 [2019-03-28 12:44:05,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.57/9.58 [2019-03-28 12:44:05,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.57/9.58 [2019-03-28 12:44:05,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.57/9.58 [2019-03-28 12:44:05,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.57/9.58 [2019-03-28 12:44:05,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.57/9.58 [2019-03-28 12:44:05,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.57/9.58 [2019-03-28 12:44:05,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.57/9.58 [2019-03-28 12:44:05,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.57/9.58 [2019-03-28 12:44:05,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.57/9.58 Termination analysis: LINEAR_WITH_GUESSES 22.57/9.58 Number of strict supporting invariants: 0 22.57/9.58 Number of non-strict supporting invariants: 1 22.57/9.58 Consider only non-deceasing supporting invariants: true 22.57/9.58 Simplify termination arguments: true 22.57/9.58 Simplify supporting invariants: trueOverapproximate stem: false 22.57/9.58 [2019-03-28 12:44:05,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.57/9.58 [2019-03-28 12:44:05,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.57/9.58 [2019-03-28 12:44:05,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.57/9.58 [2019-03-28 12:44:05,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.57/9.58 [2019-03-28 12:44:05,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.57/9.58 [2019-03-28 12:44:05,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.57/9.58 [2019-03-28 12:44:05,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.57/9.58 [2019-03-28 12:44:05,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.57/9.58 [2019-03-28 12:44:05,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.57/9.58 Termination analysis: LINEAR_WITH_GUESSES 22.57/9.58 Number of strict supporting invariants: 0 22.57/9.58 Number of non-strict supporting invariants: 1 22.57/9.58 Consider only non-deceasing supporting invariants: true 22.57/9.58 Simplify termination arguments: true 22.57/9.58 Simplify supporting invariants: trueOverapproximate stem: false 22.57/9.58 [2019-03-28 12:44:05,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.57/9.58 [2019-03-28 12:44:05,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.57/9.58 [2019-03-28 12:44:05,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.57/9.58 [2019-03-28 12:44:05,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.57/9.58 [2019-03-28 12:44:05,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 22.57/9.58 [2019-03-28 12:44:05,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 22.57/9.58 [2019-03-28 12:44:05,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.57/9.58 [2019-03-28 12:44:05,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.57/9.58 Termination analysis: LINEAR_WITH_GUESSES 22.57/9.58 Number of strict supporting invariants: 0 22.57/9.58 Number of non-strict supporting invariants: 1 22.57/9.58 Consider only non-deceasing supporting invariants: true 22.57/9.58 Simplify termination arguments: true 22.57/9.58 Simplify supporting invariants: trueOverapproximate stem: false 22.57/9.58 [2019-03-28 12:44:05,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.57/9.58 [2019-03-28 12:44:05,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.57/9.58 [2019-03-28 12:44:05,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.57/9.58 [2019-03-28 12:44:05,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.57/9.58 [2019-03-28 12:44:05,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.57/9.58 [2019-03-28 12:44:05,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.57/9.58 [2019-03-28 12:44:05,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.57/9.58 [2019-03-28 12:44:05,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.57/9.58 [2019-03-28 12:44:05,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.57/9.58 Termination analysis: LINEAR_WITH_GUESSES 22.57/9.58 Number of strict supporting invariants: 0 22.57/9.58 Number of non-strict supporting invariants: 1 22.57/9.58 Consider only non-deceasing supporting invariants: true 22.57/9.58 Simplify termination arguments: true 22.57/9.58 Simplify supporting invariants: trueOverapproximate stem: false 22.57/9.58 [2019-03-28 12:44:05,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.57/9.58 [2019-03-28 12:44:05,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.57/9.58 [2019-03-28 12:44:05,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.57/9.58 [2019-03-28 12:44:05,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.57/9.58 [2019-03-28 12:44:05,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.57/9.58 [2019-03-28 12:44:05,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.57/9.58 [2019-03-28 12:44:05,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.57/9.58 [2019-03-28 12:44:05,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.57/9.58 [2019-03-28 12:44:05,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.57/9.58 Termination analysis: LINEAR_WITH_GUESSES 22.57/9.58 Number of strict supporting invariants: 0 22.57/9.58 Number of non-strict supporting invariants: 1 22.57/9.58 Consider only non-deceasing supporting invariants: true 22.57/9.58 Simplify termination arguments: true 22.57/9.58 Simplify supporting invariants: trueOverapproximate stem: false 22.57/9.58 [2019-03-28 12:44:05,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.57/9.58 [2019-03-28 12:44:05,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.57/9.58 [2019-03-28 12:44:05,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.57/9.58 [2019-03-28 12:44:05,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.57/9.58 [2019-03-28 12:44:05,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.57/9.58 [2019-03-28 12:44:05,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.57/9.58 [2019-03-28 12:44:05,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.57/9.58 [2019-03-28 12:44:05,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.57/9.58 [2019-03-28 12:44:05,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.57/9.58 Termination analysis: LINEAR_WITH_GUESSES 22.57/9.58 Number of strict supporting invariants: 0 22.57/9.58 Number of non-strict supporting invariants: 1 22.57/9.58 Consider only non-deceasing supporting invariants: true 22.57/9.58 Simplify termination arguments: true 22.57/9.58 Simplify supporting invariants: trueOverapproximate stem: false 22.57/9.58 [2019-03-28 12:44:05,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.57/9.58 [2019-03-28 12:44:05,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.57/9.58 [2019-03-28 12:44:05,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.57/9.58 [2019-03-28 12:44:05,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.57/9.58 [2019-03-28 12:44:05,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 22.57/9.58 [2019-03-28 12:44:05,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 22.57/9.58 [2019-03-28 12:44:05,925 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 22.57/9.58 [2019-03-28 12:44:05,946 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 22.57/9.58 [2019-03-28 12:44:05,947 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. 22.57/9.58 [2019-03-28 12:44:05,947 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 22.57/9.58 [2019-03-28 12:44:05,948 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 22.57/9.58 [2019-03-28 12:44:05,949 INFO L518 LassoAnalysis]: Proved termination. 22.57/9.58 [2019-03-28 12:44:05,949 INFO L520 LassoAnalysis]: Termination argument consisting of: 22.57/9.58 Ranking function f(ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n 22.57/9.58 Supporting invariants [] 22.57/9.58 [2019-03-28 12:44:05,958 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed 22.57/9.58 [2019-03-28 12:44:05,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.57/9.58 [2019-03-28 12:44:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.57/9.58 [2019-03-28 12:44:05,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core 22.57/9.58 [2019-03-28 12:44:05,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.57/9.58 [2019-03-28 12:44:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.57/9.58 [2019-03-28 12:44:05,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core 22.57/9.58 [2019-03-28 12:44:05,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.57/9.58 [2019-03-28 12:44:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 22.57/9.58 [2019-03-28 12:44:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.57/9.58 [2019-03-28 12:44:06,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core 22.57/9.58 [2019-03-28 12:44:06,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.57/9.58 [2019-03-28 12:44:06,076 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 22.57/9.58 [2019-03-28 12:44:06,076 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 22.57/9.58 [2019-03-28 12:44:06,076 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 35 states and 44 transitions. cyclomatic complexity: 12 Second operand 3 states. 22.57/9.58 [2019-03-28 12:44:06,108 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 35 states and 44 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 4 states. 22.57/9.58 [2019-03-28 12:44:06,110 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 22.57/9.58 [2019-03-28 12:44:06,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 22.57/9.58 [2019-03-28 12:44:06,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. 22.57/9.58 [2019-03-28 12:44:06,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 3 letters. Loop has 7 letters. 22.57/9.58 [2019-03-28 12:44:06,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.57/9.58 [2019-03-28 12:44:06,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 10 letters. Loop has 7 letters. 22.57/9.58 [2019-03-28 12:44:06,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.57/9.58 [2019-03-28 12:44:06,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 3 letters. Loop has 14 letters. 22.57/9.58 [2019-03-28 12:44:06,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.57/9.58 [2019-03-28 12:44:06,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. 22.57/9.58 [2019-03-28 12:44:06,116 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 22.57/9.58 [2019-03-28 12:44:06,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 58 transitions. 22.57/9.58 [2019-03-28 12:44:06,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 22.57/9.58 [2019-03-28 12:44:06,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 22.57/9.58 [2019-03-28 12:44:06,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. 22.57/9.58 [2019-03-28 12:44:06,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 22.57/9.58 [2019-03-28 12:44:06,117 INFO L706 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. 22.57/9.58 [2019-03-28 12:44:06,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. 22.57/9.58 [2019-03-28 12:44:06,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 24. 22.57/9.58 [2019-03-28 12:44:06,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 22.57/9.58 [2019-03-28 12:44:06,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. 22.57/9.58 [2019-03-28 12:44:06,120 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. 22.57/9.58 [2019-03-28 12:44:06,120 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. 22.57/9.58 [2019-03-28 12:44:06,120 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 22.57/9.58 [2019-03-28 12:44:06,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. 22.57/9.58 [2019-03-28 12:44:06,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 22.57/9.58 [2019-03-28 12:44:06,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.57/9.58 [2019-03-28 12:44:06,121 INFO L119 BuchiIsEmpty]: Starting construction of run 22.57/9.58 [2019-03-28 12:44:06,121 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 22.57/9.58 [2019-03-28 12:44:06,121 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 22.57/9.58 [2019-03-28 12:44:06,122 INFO L794 eck$LassoCheckResult]: Stem: 386#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L19: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 377#L19 [102] L19-->L19-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 369#L19-2 [120] L19-2-->L8-3: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_sort_~x.base_1 |v_ULTIMATE.start_sort_#in~x.base_1|) (= |v_ULTIMATE.start_sort_#in~x.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= |v_ULTIMATE.start_sort_#in~x.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_sort_~n_1 |v_ULTIMATE.start_sort_#in~n_1|) (= |v_ULTIMATE.start_sort_#in~n_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_sort_~x.offset_1 |v_ULTIMATE.start_sort_#in~x.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (= v_ULTIMATE.start_sort_~pass~0_1 1)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_1, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_1, ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_1, ULTIMATE.start_sort_#t~post1=|v_ULTIMATE.start_sort_#t~post1_1|, ULTIMATE.start_sort_#in~x.base=|v_ULTIMATE.start_sort_#in~x.base_1|, ULTIMATE.start_sort_#in~n=|v_ULTIMATE.start_sort_#in~n_1|, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_1, ULTIMATE.start_sort_#t~post0=|v_ULTIMATE.start_sort_#t~post0_1|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_sort_~temp~0=v_ULTIMATE.start_sort_~temp~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_sort_#t~mem5=|v_ULTIMATE.start_sort_#t~mem5_1|, ULTIMATE.start_sort_#t~mem4=|v_ULTIMATE.start_sort_#t~mem4_1|, #length=|v_#length_1|, ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_1|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_1|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_1, ULTIMATE.start_sort_#in~x.offset=|v_ULTIMATE.start_sort_#in~x.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_sort_~x.offset, ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_#t~post1, ULTIMATE.start_sort_#in~x.base, ULTIMATE.start_sort_#in~n, ULTIMATE.start_sort_~n, ULTIMATE.start_sort_#t~post0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_sort_~temp~0, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_sort_#t~mem5, ULTIMATE.start_sort_#t~mem4, #length, ULTIMATE.start_sort_#t~mem3, ULTIMATE.start_sort_#t~mem2, ULTIMATE.start_sort_~x.base, ULTIMATE.start_sort_#in~x.offset] 365#L8-3 [75] L8-3-->L10-3: Formula: (and (= v_ULTIMATE.start_sort_~i~0_3 0) (< v_ULTIMATE.start_sort_~pass~0_5 v_ULTIMATE.start_sort_~n_4)) InVars {ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_5, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_4} OutVars{ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_5, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_4, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_3} AuxVars[] AssignedVars[ULTIMATE.start_sort_~i~0] 367#L10-3 22.57/9.58 [2019-03-28 12:44:06,122 INFO L796 eck$LassoCheckResult]: Loop: 367#L10-3 [80] L10-3-->L11: Formula: (< (+ v_ULTIMATE.start_sort_~pass~0_7 v_ULTIMATE.start_sort_~i~0_5) v_ULTIMATE.start_sort_~n_6) InVars {ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_7, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_6, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_5} OutVars{ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_7, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_6, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_5} AuxVars[] AssignedVars[] 370#L11 [91] L11-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_sort_~i~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_sort_~x.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_sort_~x.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_sort_~x.base_3)) (= |v_ULTIMATE.start_sort_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_sort_~x.base_3) .cse0)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_sort_~x.base_3))))) InVars {ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_3, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_6, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_3} OutVars{ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_3, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_6, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_2|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_3} AuxVars[] AssignedVars[ULTIMATE.start_sort_#t~mem2] 382#L11-1 [84] L11-1-->L11-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_sort_~i~0_8))) (let ((.cse1 (+ v_ULTIMATE.start_sort_~x.offset_5 .cse0 4))) (and (<= (+ v_ULTIMATE.start_sort_~x.offset_5 .cse0 8) (select |v_#length_5| v_ULTIMATE.start_sort_~x.base_6)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_sort_~x.base_6)) (<= 0 .cse1) (= |v_ULTIMATE.start_sort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_sort_~x.base_6) .cse1))))) InVars {ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_5, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_8, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_6} OutVars{ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_5, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_8, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_2|, #length=|v_#length_5|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_6} AuxVars[] AssignedVars[ULTIMATE.start_sort_#t~mem3] 378#L11-2 [110] L11-2-->L10-2: Formula: (>= |v_ULTIMATE.start_sort_#t~mem3_6| |v_ULTIMATE.start_sort_#t~mem2_6|) InVars {ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_6|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_6|} OutVars{ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_5|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_sort_#t~mem3, ULTIMATE.start_sort_#t~mem2] 372#L10-2 [81] L10-2-->L10-3: Formula: (= v_ULTIMATE.start_sort_~i~0_18 (+ v_ULTIMATE.start_sort_~i~0_19 1)) InVars {ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_19} OutVars{ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_18, ULTIMATE.start_sort_#t~post1=|v_ULTIMATE.start_sort_#t~post1_2|} AuxVars[] AssignedVars[ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_#t~post1] 367#L10-3 22.57/9.58 [2019-03-28 12:44:06,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.57/9.58 [2019-03-28 12:44:06,123 INFO L82 PathProgramCache]: Analyzing trace with hash 5345033, now seen corresponding path program 1 times 22.57/9.58 [2019-03-28 12:44:06,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.57/9.58 [2019-03-28 12:44:06,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.57/9.58 [2019-03-28 12:44:06,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:06,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:06,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.57/9.58 [2019-03-28 12:44:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.57/9.58 [2019-03-28 12:44:06,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.57/9.58 [2019-03-28 12:44:06,133 INFO L82 PathProgramCache]: Analyzing trace with hash 105306027, now seen corresponding path program 1 times 22.57/9.58 [2019-03-28 12:44:06,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.57/9.58 [2019-03-28 12:44:06,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.57/9.58 [2019-03-28 12:44:06,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:06,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:06,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.57/9.58 [2019-03-28 12:44:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.57/9.58 [2019-03-28 12:44:06,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.57/9.58 [2019-03-28 12:44:06,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1556255325, now seen corresponding path program 1 times 22.57/9.58 [2019-03-28 12:44:06,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.57/9.58 [2019-03-28 12:44:06,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.57/9.58 [2019-03-28 12:44:06,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:06,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:06,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.57/9.58 [2019-03-28 12:44:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.57/9.58 [2019-03-28 12:44:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.57/9.58 [2019-03-28 12:44:06,329 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 22.57/9.58 [2019-03-28 12:44:06,396 INFO L216 LassoAnalysis]: Preferences: 22.57/9.58 [2019-03-28 12:44:06,396 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 22.57/9.58 [2019-03-28 12:44:06,396 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 22.57/9.58 [2019-03-28 12:44:06,397 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 22.57/9.58 [2019-03-28 12:44:06,397 INFO L127 ssoRankerPreferences]: Use exernal solver: false 22.57/9.58 [2019-03-28 12:44:06,397 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 22.57/9.58 [2019-03-28 12:44:06,397 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 22.57/9.58 [2019-03-28 12:44:06,397 INFO L130 ssoRankerPreferences]: Path of dumped script: 22.57/9.58 [2019-03-28 12:44:06,397 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 22.57/9.58 [2019-03-28 12:44:06,397 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 22.57/9.58 [2019-03-28 12:44:06,397 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 22.57/9.58 [2019-03-28 12:44:06,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:06,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:06,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:06,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:06,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:06,546 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 22.57/9.58 [2019-03-28 12:44:06,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:06,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:06,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:06,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:06,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:06,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:06,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.57/9.58 [2019-03-28 12:44:06,846 INFO L300 LassoAnalysis]: Preprocessing complete. 22.57/9.58 [2019-03-28 12:44:06,847 INFO L497 LassoAnalysis]: Using template 'affine'. 22.57/9.58 [2019-03-28 12:44:06,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.57/9.58 Termination analysis: LINEAR_WITH_GUESSES 22.57/9.58 Number of strict supporting invariants: 0 22.57/9.58 Number of non-strict supporting invariants: 1 22.57/9.58 Consider only non-deceasing supporting invariants: true 22.57/9.58 Simplify termination arguments: true 22.57/9.58 Simplify supporting invariants: trueOverapproximate stem: false 22.57/9.58 [2019-03-28 12:44:06,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.57/9.58 [2019-03-28 12:44:06,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.57/9.58 [2019-03-28 12:44:06,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.57/9.58 [2019-03-28 12:44:06,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.57/9.58 [2019-03-28 12:44:06,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.57/9.58 [2019-03-28 12:44:06,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.57/9.58 [2019-03-28 12:44:06,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.57/9.58 [2019-03-28 12:44:06,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.57/9.58 [2019-03-28 12:44:06,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.57/9.58 Termination analysis: LINEAR_WITH_GUESSES 22.57/9.58 Number of strict supporting invariants: 0 22.57/9.58 Number of non-strict supporting invariants: 1 22.57/9.58 Consider only non-deceasing supporting invariants: true 22.57/9.58 Simplify termination arguments: true 22.57/9.58 Simplify supporting invariants: trueOverapproximate stem: false 22.57/9.58 [2019-03-28 12:44:06,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.57/9.58 [2019-03-28 12:44:06,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.57/9.58 [2019-03-28 12:44:06,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.57/9.58 [2019-03-28 12:44:06,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.57/9.58 [2019-03-28 12:44:06,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.57/9.58 [2019-03-28 12:44:06,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.57/9.58 [2019-03-28 12:44:06,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.57/9.58 [2019-03-28 12:44:06,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.57/9.58 [2019-03-28 12:44:06,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.57/9.58 Termination analysis: LINEAR_WITH_GUESSES 22.57/9.58 Number of strict supporting invariants: 0 22.57/9.58 Number of non-strict supporting invariants: 1 22.57/9.58 Consider only non-deceasing supporting invariants: true 22.57/9.58 Simplify termination arguments: true 22.57/9.58 Simplify supporting invariants: trueOverapproximate stem: false 22.57/9.58 [2019-03-28 12:44:06,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.57/9.58 [2019-03-28 12:44:06,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.57/9.58 [2019-03-28 12:44:06,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.57/9.58 [2019-03-28 12:44:06,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.57/9.58 [2019-03-28 12:44:06,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 22.57/9.58 [2019-03-28 12:44:06,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 22.57/9.58 [2019-03-28 12:44:06,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.57/9.58 [2019-03-28 12:44:06,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.57/9.58 Termination analysis: LINEAR_WITH_GUESSES 22.57/9.58 Number of strict supporting invariants: 0 22.57/9.58 Number of non-strict supporting invariants: 1 22.57/9.58 Consider only non-deceasing supporting invariants: true 22.57/9.58 Simplify termination arguments: true 22.57/9.58 Simplify supporting invariants: trueOverapproximate stem: false 22.57/9.58 [2019-03-28 12:44:06,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.57/9.58 [2019-03-28 12:44:06,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.57/9.58 [2019-03-28 12:44:06,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.57/9.58 [2019-03-28 12:44:06,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.57/9.58 [2019-03-28 12:44:06,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.57/9.58 [2019-03-28 12:44:06,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.57/9.58 [2019-03-28 12:44:06,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.57/9.58 [2019-03-28 12:44:06,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.57/9.58 [2019-03-28 12:44:06,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.57/9.58 Termination analysis: LINEAR_WITH_GUESSES 22.57/9.58 Number of strict supporting invariants: 0 22.57/9.58 Number of non-strict supporting invariants: 1 22.57/9.58 Consider only non-deceasing supporting invariants: true 22.57/9.58 Simplify termination arguments: true 22.57/9.58 Simplify supporting invariants: trueOverapproximate stem: false 22.57/9.58 [2019-03-28 12:44:06,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.57/9.58 [2019-03-28 12:44:06,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.57/9.58 [2019-03-28 12:44:06,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.57/9.58 [2019-03-28 12:44:06,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.57/9.58 [2019-03-28 12:44:06,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.57/9.58 [2019-03-28 12:44:06,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.57/9.58 [2019-03-28 12:44:06,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.57/9.58 [2019-03-28 12:44:06,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.57/9.58 [2019-03-28 12:44:06,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.57/9.58 Termination analysis: LINEAR_WITH_GUESSES 22.57/9.58 Number of strict supporting invariants: 0 22.57/9.58 Number of non-strict supporting invariants: 1 22.57/9.58 Consider only non-deceasing supporting invariants: true 22.57/9.58 Simplify termination arguments: true 22.57/9.58 Simplify supporting invariants: trueOverapproximate stem: false 22.57/9.58 [2019-03-28 12:44:06,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.57/9.58 [2019-03-28 12:44:06,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.57/9.58 [2019-03-28 12:44:06,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.57/9.58 [2019-03-28 12:44:06,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.57/9.58 [2019-03-28 12:44:06,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 22.57/9.58 [2019-03-28 12:44:06,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 22.57/9.58 [2019-03-28 12:44:06,882 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 22.57/9.58 [2019-03-28 12:44:06,899 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 22.57/9.58 [2019-03-28 12:44:06,899 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. 22.57/9.58 [2019-03-28 12:44:06,900 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 22.57/9.58 [2019-03-28 12:44:06,901 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 22.57/9.58 [2019-03-28 12:44:06,901 INFO L518 LassoAnalysis]: Proved termination. 22.57/9.58 [2019-03-28 12:44:06,902 INFO L520 LassoAnalysis]: Termination argument consisting of: 22.57/9.58 Ranking function f(ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~i~0 - 1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n 22.57/9.58 Supporting invariants [] 22.57/9.58 [2019-03-28 12:44:06,915 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed 22.57/9.58 [2019-03-28 12:44:06,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.57/9.58 [2019-03-28 12:44:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.57/9.58 [2019-03-28 12:44:06,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core 22.57/9.58 [2019-03-28 12:44:06,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.57/9.58 [2019-03-28 12:44:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.57/9.58 [2019-03-28 12:44:06,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core 22.57/9.58 [2019-03-28 12:44:06,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.57/9.58 [2019-03-28 12:44:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.57/9.58 [2019-03-28 12:44:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.57/9.58 [2019-03-28 12:44:06,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core 22.57/9.58 [2019-03-28 12:44:06,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.57/9.58 [2019-03-28 12:44:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.57/9.58 [2019-03-28 12:44:07,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core 22.57/9.58 [2019-03-28 12:44:07,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.57/9.58 [2019-03-28 12:44:07,036 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 22.57/9.58 [2019-03-28 12:44:07,036 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 22.57/9.58 [2019-03-28 12:44:07,036 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 24 states and 31 transitions. cyclomatic complexity: 9 Second operand 3 states. 22.57/9.58 [2019-03-28 12:44:07,125 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 24 states and 31 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 110 states and 129 transitions. Complement of second has 13 states. 22.57/9.58 [2019-03-28 12:44:07,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states 22.57/9.58 [2019-03-28 12:44:07,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 22.57/9.58 [2019-03-28 12:44:07,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. 22.57/9.58 [2019-03-28 12:44:07,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 40 transitions. Stem has 4 letters. Loop has 5 letters. 22.57/9.58 [2019-03-28 12:44:07,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.57/9.58 [2019-03-28 12:44:07,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 40 transitions. Stem has 9 letters. Loop has 5 letters. 22.57/9.58 [2019-03-28 12:44:07,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.57/9.58 [2019-03-28 12:44:07,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 40 transitions. Stem has 4 letters. Loop has 10 letters. 22.57/9.58 [2019-03-28 12:44:07,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.57/9.58 [2019-03-28 12:44:07,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 129 transitions. 22.57/9.58 [2019-03-28 12:44:07,133 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 22.57/9.58 [2019-03-28 12:44:07,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 0 states and 0 transitions. 22.57/9.58 [2019-03-28 12:44:07,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 22.57/9.58 [2019-03-28 12:44:07,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 22.57/9.58 [2019-03-28 12:44:07,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 22.57/9.58 [2019-03-28 12:44:07,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 22.57/9.58 [2019-03-28 12:44:07,134 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 22.57/9.58 [2019-03-28 12:44:07,134 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 22.57/9.58 [2019-03-28 12:44:07,134 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 22.57/9.58 [2019-03-28 12:44:07,134 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 22.57/9.58 [2019-03-28 12:44:07,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 22.57/9.58 [2019-03-28 12:44:07,135 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 22.57/9.58 [2019-03-28 12:44:07,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 22.57/9.58 [2019-03-28 12:44:07,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:07 BasicIcfg 22.57/9.58 [2019-03-28 12:44:07,141 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 22.57/9.58 [2019-03-28 12:44:07,141 INFO L168 Benchmark]: Toolchain (without parser) took 5213.66 ms. Allocated memory was 649.6 MB in the beginning and 770.2 MB in the end (delta: 120.6 MB). Free memory was 559.5 MB in the beginning and 629.9 MB in the end (delta: -70.4 MB). Peak memory consumption was 50.2 MB. Max. memory is 50.3 GB. 22.57/9.58 [2019-03-28 12:44:07,142 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 22.57/9.58 [2019-03-28 12:44:07,143 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.98 ms. Allocated memory was 649.6 MB in the beginning and 680.5 MB in the end (delta: 30.9 MB). Free memory was 559.5 MB in the beginning and 645.6 MB in the end (delta: -86.0 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 22.57/9.58 [2019-03-28 12:44:07,143 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.06 ms. Allocated memory is still 680.5 MB. Free memory was 645.6 MB in the beginning and 643.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. 22.57/9.58 [2019-03-28 12:44:07,144 INFO L168 Benchmark]: Boogie Preprocessor took 26.20 ms. Allocated memory is still 680.5 MB. Free memory was 643.4 MB in the beginning and 642.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 22.57/9.58 [2019-03-28 12:44:07,145 INFO L168 Benchmark]: RCFGBuilder took 316.40 ms. Allocated memory is still 680.5 MB. Free memory was 642.3 MB in the beginning and 618.7 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 50.3 GB. 22.57/9.58 [2019-03-28 12:44:07,145 INFO L168 Benchmark]: BlockEncodingV2 took 126.27 ms. Allocated memory is still 680.5 MB. Free memory was 618.7 MB in the beginning and 611.1 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 50.3 GB. 22.57/9.58 [2019-03-28 12:44:07,146 INFO L168 Benchmark]: TraceAbstraction took 1134.45 ms. Allocated memory is still 680.5 MB. Free memory was 610.1 MB in the beginning and 508.3 MB in the end (delta: 101.8 MB). Peak memory consumption was 101.8 MB. Max. memory is 50.3 GB. 22.57/9.58 [2019-03-28 12:44:07,146 INFO L168 Benchmark]: BuchiAutomizer took 3248.76 ms. Allocated memory was 680.5 MB in the beginning and 770.2 MB in the end (delta: 89.7 MB). Free memory was 508.3 MB in the beginning and 629.9 MB in the end (delta: -121.6 MB). There was no memory consumed. Max. memory is 50.3 GB. 22.57/9.58 [2019-03-28 12:44:07,150 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 22.57/9.58 --- Results --- 22.57/9.58 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 22.57/9.58 - StatisticsResult: Initial Icfg 22.57/9.58 33 locations, 38 edges 22.57/9.58 - StatisticsResult: Encoded RCFG 22.57/9.58 25 locations, 41 edges 22.57/9.58 * Results from de.uni_freiburg.informatik.ultimate.core: 22.57/9.58 - StatisticsResult: Toolchain Benchmarks 22.57/9.58 Benchmark results are: 22.57/9.58 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 22.57/9.58 * CACSL2BoogieTranslator took 315.98 ms. Allocated memory was 649.6 MB in the beginning and 680.5 MB in the end (delta: 30.9 MB). Free memory was 559.5 MB in the beginning and 645.6 MB in the end (delta: -86.0 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 22.57/9.58 * Boogie Procedure Inliner took 40.06 ms. Allocated memory is still 680.5 MB. Free memory was 645.6 MB in the beginning and 643.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. 22.57/9.58 * Boogie Preprocessor took 26.20 ms. Allocated memory is still 680.5 MB. Free memory was 643.4 MB in the beginning and 642.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 22.57/9.58 * RCFGBuilder took 316.40 ms. Allocated memory is still 680.5 MB. Free memory was 642.3 MB in the beginning and 618.7 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 50.3 GB. 22.57/9.58 * BlockEncodingV2 took 126.27 ms. Allocated memory is still 680.5 MB. Free memory was 618.7 MB in the beginning and 611.1 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 50.3 GB. 22.57/9.58 * TraceAbstraction took 1134.45 ms. Allocated memory is still 680.5 MB. Free memory was 610.1 MB in the beginning and 508.3 MB in the end (delta: 101.8 MB). Peak memory consumption was 101.8 MB. Max. memory is 50.3 GB. 22.57/9.58 * BuchiAutomizer took 3248.76 ms. Allocated memory was 680.5 MB in the beginning and 770.2 MB in the end (delta: 89.7 MB). Free memory was 508.3 MB in the beginning and 629.9 MB in the end (delta: -121.6 MB). There was no memory consumed. Max. memory is 50.3 GB. 22.57/9.58 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 22.57/9.58 - GenericResult: Unfinished Backtranslation 22.57/9.58 unknown boogie variable #length 22.57/9.58 - GenericResult: Unfinished Backtranslation 22.57/9.58 unknown boogie variable #length 22.57/9.58 - GenericResult: Unfinished Backtranslation 22.57/9.58 unknown boogie variable #length 22.57/9.58 - GenericResult: Unfinished Backtranslation 22.57/9.58 unknown boogie variable #length 22.57/9.58 - GenericResult: Unfinished Backtranslation 22.57/9.58 unknown boogie variable #length 22.57/9.58 - GenericResult: Unfinished Backtranslation 22.57/9.58 unknown boogie variable #length 22.57/9.58 - GenericResult: Unfinished Backtranslation 22.57/9.58 unknown boogie variable #length 22.57/9.58 - GenericResult: Unfinished Backtranslation 22.57/9.58 unknown boogie variable #length 22.57/9.58 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 22.57/9.58 - PositiveResult [Line: 11]: pointer dereference always succeeds 22.57/9.58 For all program executions holds that pointer dereference always succeeds at this location 22.57/9.58 - PositiveResult [Line: 13]: pointer dereference always succeeds 22.57/9.58 For all program executions holds that pointer dereference always succeeds at this location 22.57/9.58 - PositiveResult [Line: 13]: pointer dereference always succeeds 22.57/9.58 For all program executions holds that pointer dereference always succeeds at this location 22.57/9.58 - PositiveResult [Line: 11]: pointer dereference always succeeds 22.57/9.58 For all program executions holds that pointer dereference always succeeds at this location 22.57/9.58 - PositiveResult [Line: 11]: pointer dereference always succeeds 22.57/9.58 For all program executions holds that pointer dereference always succeeds at this location 22.57/9.58 - PositiveResult [Line: 13]: pointer dereference always succeeds 22.57/9.58 For all program executions holds that pointer dereference always succeeds at this location 22.57/9.58 - PositiveResult [Line: 13]: pointer dereference always succeeds 22.57/9.58 For all program executions holds that pointer dereference always succeeds at this location 22.57/9.58 - PositiveResult [Line: 11]: pointer dereference always succeeds 22.57/9.58 For all program executions holds that pointer dereference always succeeds at this location 22.57/9.58 - PositiveResult [Line: 13]: pointer dereference always succeeds 22.57/9.58 For all program executions holds that pointer dereference always succeeds at this location 22.57/9.58 - PositiveResult [Line: 13]: pointer dereference always succeeds 22.57/9.58 For all program executions holds that pointer dereference always succeeds at this location 22.57/9.58 - PositiveResult [Line: 13]: pointer dereference always succeeds 22.57/9.58 For all program executions holds that pointer dereference always succeeds at this location 22.57/9.58 - PositiveResult [Line: 13]: pointer dereference always succeeds 22.57/9.58 For all program executions holds that pointer dereference always succeeds at this location 22.57/9.58 - AllSpecificationsHoldResult: All specifications hold 22.57/9.58 12 specifications checked. All of them hold 22.57/9.58 - InvariantResult [Line: 8]: Loop Invariant 22.57/9.58 [2019-03-28 12:44:07,159 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.57/9.58 [2019-03-28 12:44:07,159 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.57/9.58 Derived loop invariant: ((1 == \valid[x] && x == 0) && 4 * n + 4 <= unknown-#length-unknown[x] + 4 * pass) || ((1 == \valid[x] && n <= pass) && array_size <= 1) 22.57/9.58 - InvariantResult [Line: 10]: Loop Invariant 22.57/9.58 [2019-03-28 12:44:07,160 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.57/9.58 [2019-03-28 12:44:07,160 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.57/9.58 [2019-03-28 12:44:07,161 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.57/9.58 [2019-03-28 12:44:07,161 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.57/9.58 [2019-03-28 12:44:07,162 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.57/9.58 [2019-03-28 12:44:07,162 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.57/9.58 Derived loop invariant: (((1 == \valid[x] && x == 0) && 4 * n + 4 <= unknown-#length-unknown[x] + 4 * pass) && 4 <= x + 4 * i) || ((((1 == \valid[x] && i == 0) && x == 0) && 4 * n + 4 <= unknown-#length-unknown[x] + 4 * pass) && 4 * i + 8 <= unknown-#length-unknown[x]) 22.57/9.58 - StatisticsResult: Ultimate Automizer benchmark data 22.57/9.58 CFG has 1 procedures, 25 locations, 12 error locations. SAFE Result, 1.0s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 34 SDtfs, 124 SDslu, 64 SDs, 0 SdLazy, 194 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=3, 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, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 99 HoareAnnotationTreeSize, 2 FomulaSimplifications, 160 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 30 ConstructedInterpolants, 0 QuantifiedInterpolants, 870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 22.57/9.58 - StatisticsResult: Constructed decomposition of program 22.57/9.58 Your program was decomposed into 4 terminating modules (1 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function -1 * pass + n and consists of 3 locations. One nondeterministic module has affine ranking function -1 * pass + n and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i + -1 * pass + n and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. 22.57/9.58 - StatisticsResult: Timing statistics 22.57/9.58 BüchiAutomizer plugin needed 3.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 23 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 61 SDtfs, 154 SDslu, 45 SDs, 0 SdLazy, 121 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital119 mio100 ax100 hnf100 lsp94 ukn90 mio100 lsp64 div100 bol100 ite100 ukn100 eq184 hnf88 smp98 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 22.57/9.58 - TerminationAnalysisResult: Termination proven 22.57/9.58 Buchi Automizer proved that your program is terminating 22.57/9.58 RESULT: Ultimate proved your program to be correct! 22.57/9.58 !SESSION 2019-03-28 12:43:58.670 ----------------------------------------------- 22.57/9.58 eclipse.buildId=unknown 22.57/9.58 java.version=1.8.0_181 22.57/9.58 java.vendor=Oracle Corporation 22.57/9.58 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 22.57/9.58 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 22.57/9.58 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 22.57/9.58 22.57/9.58 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:44:07.387 22.57/9.58 !MESSAGE The workspace will exit with unsaved changes in this session. 22.57/9.58 Received shutdown request... 22.57/9.58 Ultimate: 22.57/9.58 GTK+ Version Check 22.57/9.58 EOF