YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:14:24,141 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:14:24,143 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:14:24,154 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:14:24,154 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:14:24,155 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:14:24,156 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:14:24,158 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:14:24,159 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:14:24,160 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:14:24,161 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:14:24,161 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:14:24,162 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:14:24,163 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:14:24,164 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:14:24,165 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:14:24,166 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:14:24,167 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:14:24,169 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:14:24,170 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:14:24,171 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:14:24,173 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:14:24,175 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:14:24,175 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:14:24,175 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:14:24,176 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:14:24,176 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:14:24,177 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:14:24,177 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:14:24,178 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:14:24,178 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:14:24,179 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:14:24,180 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:14:24,180 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:14:24,181 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:14:24,181 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:14:24,181 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:14:24,182 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:14:24,183 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:14:24,183 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 10:14:24,197 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:14:24,197 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:14:24,198 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:14:24,198 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:14:24,199 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:14:24,199 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:14:24,199 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:14:24,199 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:14:24,199 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:14:24,199 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:14:24,200 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:14:24,200 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:14:24,200 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:14:24,200 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:14:24,200 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:14:24,200 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:14:24,200 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:14:24,201 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:14:24,201 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:14:24,201 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:14:24,201 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:14:24,201 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:14:24,201 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:14:24,202 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:14:24,202 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:14:24,202 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:14:24,202 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:14:24,202 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:14:24,202 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:14:24,227 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:14:24,241 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:14:24,244 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:14:24,246 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:14:24,246 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:14:24,247 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 10:14:24,314 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/95f44091cf7d4635986f933ba642cd88/FLAG7c81e2bf0 [2020-06-22 10:14:24,660 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:14:24,661 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 10:14:24,661 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:14:24,667 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/95f44091cf7d4635986f933ba642cd88/FLAG7c81e2bf0 [2020-06-22 10:14:25,069 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/95f44091cf7d4635986f933ba642cd88 [2020-06-22 10:14:25,080 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:14:25,082 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:14:25,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:14:25,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:14:25,086 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:14:25,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:14:25" (1/1) ... [2020-06-22 10:14:25,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f4dd3e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25, skipping insertion in model container [2020-06-22 10:14:25,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:14:25" (1/1) ... [2020-06-22 10:14:25,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:14:25,115 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:14:25,269 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:14:25,336 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:14:25,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:14:25,368 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:14:25,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25 WrapperNode [2020-06-22 10:14:25,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:14:25,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:14:25,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:14:25,369 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:14:25,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25" (1/1) ... [2020-06-22 10:14:25,386 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25" (1/1) ... [2020-06-22 10:14:25,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:14:25,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:14:25,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:14:25,409 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:14:25,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25" (1/1) ... [2020-06-22 10:14:25,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25" (1/1) ... [2020-06-22 10:14:25,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25" (1/1) ... [2020-06-22 10:14:25,420 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25" (1/1) ... [2020-06-22 10:14:25,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25" (1/1) ... [2020-06-22 10:14:25,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25" (1/1) ... [2020-06-22 10:14:25,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25" (1/1) ... [2020-06-22 10:14:25,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:14:25,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:14:25,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:14:25,431 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:14:25,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:14:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:14:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:14:25,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:14:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:14:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:14:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:14:25,711 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:14:25,711 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 10:14:25,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:14:25 BoogieIcfgContainer [2020-06-22 10:14:25,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:14:25,713 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:14:25,713 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:14:25,716 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:14:25,717 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:14:25" (1/1) ... [2020-06-22 10:14:25,734 INFO L313 BlockEncoder]: Initial Icfg 35 locations, 38 edges [2020-06-22 10:14:25,735 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:14:25,736 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:14:25,736 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:14:25,737 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:14:25,739 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:14:25,739 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:14:25,740 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:14:25,761 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:14:25,791 INFO L200 BlockEncoder]: SBE split 18 edges [2020-06-22 10:14:25,796 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 10:14:25,798 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:14:25,836 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-06-22 10:14:25,839 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 10:14:25,841 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:14:25,841 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:14:25,841 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:14:25,842 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:14:25,843 INFO L313 BlockEncoder]: Encoded RCFG 28 locations, 50 edges [2020-06-22 10:14:25,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:14:25 BasicIcfg [2020-06-22 10:14:25,844 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:14:25,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:14:25,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:14:25,848 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:14:25,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:14:25" (1/4) ... [2020-06-22 10:14:25,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169b68cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:14:25, skipping insertion in model container [2020-06-22 10:14:25,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25" (2/4) ... [2020-06-22 10:14:25,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169b68cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:14:25, skipping insertion in model container [2020-06-22 10:14:25,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:14:25" (3/4) ... [2020-06-22 10:14:25,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169b68cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:14:25, skipping insertion in model container [2020-06-22 10:14:25,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:14:25" (4/4) ... [2020-06-22 10:14:25,851 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:14:25,861 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:14:25,869 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-06-22 10:14:25,885 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-06-22 10:14:25,914 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:14:25,914 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:14:25,915 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:14:25,915 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:14:25,915 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:14:25,915 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:14:25,915 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:14:25,916 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:14:25,916 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:14:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-06-22 10:14:25,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:14:25,937 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:14:25,937 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:14:25,938 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 10:14:25,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:25,943 INFO L82 PathProgramCache]: Analyzing trace with hash 113174, now seen corresponding path program 1 times [2020-06-22 10:14:25,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:25,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:25,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:25,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:25,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:14:26,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:14:26,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:14:26,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:14:26,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:14:26,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:14:26,137 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2020-06-22 10:14:26,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:14:26,256 INFO L93 Difference]: Finished difference Result 28 states and 50 transitions. [2020-06-22 10:14:26,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:14:26,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:14:26,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:14:26,272 INFO L225 Difference]: With dead ends: 28 [2020-06-22 10:14:26,272 INFO L226 Difference]: Without dead ends: 24 [2020-06-22 10:14:26,276 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 [2020-06-22 10:14:26,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-06-22 10:14:26,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-06-22 10:14:26,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 10:14:26,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 42 transitions. [2020-06-22 10:14:26,314 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 42 transitions. Word has length 3 [2020-06-22 10:14:26,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:14:26,316 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 42 transitions. [2020-06-22 10:14:26,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:14:26,316 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 42 transitions. [2020-06-22 10:14:26,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:14:26,316 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:14:26,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:14:26,317 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 10:14:26,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:26,317 INFO L82 PathProgramCache]: Analyzing trace with hash 113176, now seen corresponding path program 1 times [2020-06-22 10:14:26,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:26,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:26,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:26,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:26,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:14:26,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:14:26,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:14:26,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:14:26,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:14:26,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:14:26,344 INFO L87 Difference]: Start difference. First operand 24 states and 42 transitions. Second operand 3 states. [2020-06-22 10:14:26,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:14:26,405 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. [2020-06-22 10:14:26,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:14:26,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:14:26,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:14:26,406 INFO L225 Difference]: With dead ends: 28 [2020-06-22 10:14:26,406 INFO L226 Difference]: Without dead ends: 24 [2020-06-22 10:14:26,407 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 [2020-06-22 10:14:26,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-06-22 10:14:26,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-06-22 10:14:26,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 10:14:26,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2020-06-22 10:14:26,411 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 38 transitions. Word has length 3 [2020-06-22 10:14:26,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:14:26,412 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 38 transitions. [2020-06-22 10:14:26,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:14:26,412 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 38 transitions. [2020-06-22 10:14:26,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:14:26,412 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:14:26,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:14:26,413 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 10:14:26,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:26,413 INFO L82 PathProgramCache]: Analyzing trace with hash 113177, now seen corresponding path program 1 times [2020-06-22 10:14:26,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:26,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:26,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:26,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:26,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:14:26,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:14:26,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:14:26,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:14:26,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:14:26,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:14:26,452 INFO L87 Difference]: Start difference. First operand 24 states and 38 transitions. Second operand 3 states. [2020-06-22 10:14:26,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:14:26,515 INFO L93 Difference]: Finished difference Result 24 states and 38 transitions. [2020-06-22 10:14:26,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:14:26,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:14:26,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:14:26,516 INFO L225 Difference]: With dead ends: 24 [2020-06-22 10:14:26,516 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 10:14:26,517 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 [2020-06-22 10:14:26,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 10:14:26,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 10:14:26,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 10:14:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2020-06-22 10:14:26,521 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 34 transitions. Word has length 3 [2020-06-22 10:14:26,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:14:26,521 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 34 transitions. [2020-06-22 10:14:26,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:14:26,521 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 34 transitions. [2020-06-22 10:14:26,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:14:26,522 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:14:26,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:14:26,522 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 10:14:26,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:26,522 INFO L82 PathProgramCache]: Analyzing trace with hash -925009780, now seen corresponding path program 1 times [2020-06-22 10:14:26,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:26,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:26,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:26,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:26,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:14:26,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:14:26,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:14:26,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:14:26,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:14:26,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:14:26,551 INFO L87 Difference]: Start difference. First operand 20 states and 34 transitions. Second operand 3 states. [2020-06-22 10:14:26,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:14:26,614 INFO L93 Difference]: Finished difference Result 20 states and 34 transitions. [2020-06-22 10:14:26,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:14:26,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 10:14:26,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:14:26,616 INFO L225 Difference]: With dead ends: 20 [2020-06-22 10:14:26,616 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 10:14:26,616 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 [2020-06-22 10:14:26,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 10:14:26,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 10:14:26,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 10:14:26,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. [2020-06-22 10:14:26,619 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 6 [2020-06-22 10:14:26,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:14:26,620 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 28 transitions. [2020-06-22 10:14:26,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:14:26,621 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 28 transitions. [2020-06-22 10:14:26,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:14:26,621 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:14:26,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:14:26,621 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 10:14:26,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:26,622 INFO L82 PathProgramCache]: Analyzing trace with hash -925009778, now seen corresponding path program 1 times [2020-06-22 10:14:26,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:26,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:26,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:26,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:26,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:14:26,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:14:26,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:14:26,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:14:26,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:14:26,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:14:26,648 INFO L87 Difference]: Start difference. First operand 17 states and 28 transitions. Second operand 3 states. [2020-06-22 10:14:26,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:14:26,679 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2020-06-22 10:14:26,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:14:26,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 10:14:26,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:14:26,680 INFO L225 Difference]: With dead ends: 20 [2020-06-22 10:14:26,681 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 10:14:26,681 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 [2020-06-22 10:14:26,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 10:14:26,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 10:14:26,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 10:14:26,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2020-06-22 10:14:26,684 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 25 transitions. Word has length 6 [2020-06-22 10:14:26,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:14:26,684 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-06-22 10:14:26,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:14:26,685 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 25 transitions. [2020-06-22 10:14:26,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:14:26,685 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:14:26,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:14:26,685 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 10:14:26,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:26,686 INFO L82 PathProgramCache]: Analyzing trace with hash -925009777, now seen corresponding path program 1 times [2020-06-22 10:14:26,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:26,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:26,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:26,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:26,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:14:26,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:14:26,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:14:26,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:14:26,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:14:26,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:14:26,716 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand 3 states. [2020-06-22 10:14:26,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:14:26,747 INFO L93 Difference]: Finished difference Result 17 states and 25 transitions. [2020-06-22 10:14:26,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:14:26,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 10:14:26,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:14:26,748 INFO L225 Difference]: With dead ends: 17 [2020-06-22 10:14:26,748 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:14:26,748 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 [2020-06-22 10:14:26,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:14:26,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:14:26,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:14:26,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:14:26,749 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2020-06-22 10:14:26,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:14:26,750 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:14:26,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:14:26,750 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:14:26,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:14:26,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:14:26,776 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 10:14:26,777 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-06-22 10:14:26,777 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 10:14:26,777 INFO L448 ceAbstractionStarter]: For program point L9(lines 9 14) no Hoare annotation was computed. [2020-06-22 10:14:26,777 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 10:14:26,778 INFO L444 ceAbstractionStarter]: At program point L9-2(lines 8 15) the Hoare annotation is: (and (= (select |#valid| ULTIMATE.start_main_~y~0.base) 1) (= (select |#length| ULTIMATE.start_main_~y~0.base) 4) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= ULTIMATE.start_main_~x~0.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~x~0.base)) (= ULTIMATE.start_main_~y~0.offset 0)) [2020-06-22 10:14:26,778 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 10:14:26,778 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 10:14:26,778 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:14:26,778 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:14:26,778 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 10:14:26,778 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:14:26,778 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:14:26,778 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:14:26,779 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:14:26,779 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:14:26,779 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:14:26,779 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:14:26,779 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:14:26,779 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:14:26,779 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 10:14:26,779 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2020-06-22 10:14:26,780 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-06-22 10:14:26,780 INFO L448 ceAbstractionStarter]: For program point L8-1(line 8) no Hoare annotation was computed. [2020-06-22 10:14:26,780 INFO L448 ceAbstractionStarter]: For program point L8-2(line 8) no Hoare annotation was computed. [2020-06-22 10:14:26,780 INFO L448 ceAbstractionStarter]: For program point L8-3(line 8) no Hoare annotation was computed. [2020-06-22 10:14:26,780 INFO L448 ceAbstractionStarter]: For program point L8-4(line 8) no Hoare annotation was computed. [2020-06-22 10:14:26,780 INFO L448 ceAbstractionStarter]: For program point L8-6(lines 8 15) no Hoare annotation was computed. [2020-06-22 10:14:26,780 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:14:26,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:14:26,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:14:26,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:14:26,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:14:26,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:14:26 BasicIcfg [2020-06-22 10:14:26,798 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:14:26,799 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:14:26,799 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:14:26,802 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:14:26,803 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:14:26,803 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:14:25" (1/5) ... [2020-06-22 10:14:26,804 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59cf30b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:14:26, skipping insertion in model container [2020-06-22 10:14:26,804 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:14:26,804 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25" (2/5) ... [2020-06-22 10:14:26,805 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59cf30b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:14:26, skipping insertion in model container [2020-06-22 10:14:26,805 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:14:26,805 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:14:25" (3/5) ... [2020-06-22 10:14:26,805 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59cf30b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:14:26, skipping insertion in model container [2020-06-22 10:14:26,805 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:14:26,805 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:14:25" (4/5) ... [2020-06-22 10:14:26,806 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59cf30b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:14:26, skipping insertion in model container [2020-06-22 10:14:26,806 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:14:26,806 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:14:26" (5/5) ... [2020-06-22 10:14:26,807 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:14:26,827 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:14:26,828 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:14:26,828 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:14:26,828 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:14:26,828 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:14:26,828 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:14:26,828 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:14:26,828 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:14:26,828 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:14:26,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2020-06-22 10:14:26,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 10:14:26,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:14:26,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:14:26,842 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:14:26,842 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:14:26,842 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:14:26,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2020-06-22 10:14:26,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 10:14:26,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:14:26,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:14:26,844 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:14:26,845 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:14:26,849 INFO L794 eck$LassoCheckResult]: Stem: 21#ULTIMATE.startENTRYtrue [83] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 10#L-1true [116] L-1-->L9-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem3] 5#L9-2true [2020-06-22 10:14:26,850 INFO L796 eck$LassoCheckResult]: Loop: 5#L9-2true [59] L9-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 17#L8-1true [121] L8-1-->L8-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem2_3|) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 16#L8-2true [77] L8-2-->L8-6: Formula: (not |v_ULTIMATE.start_main_#t~short4_5|) InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} AuxVars[] AssignedVars[] 25#L8-6true [90] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 8#L9true [129] L9-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 11#L10true [65] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 19#L10-1true [155] L10-1-->L9-2: Formula: (and (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~x~0.base_17)) (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem6_6| (- 1)))) |v_#memory_int_13|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13)) InVars {#valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|} OutVars{#valid=|v_#valid_30|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem6] 5#L9-2true [2020-06-22 10:14:26,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:26,851 INFO L82 PathProgramCache]: Analyzing trace with hash 3650, now seen corresponding path program 1 times [2020-06-22 10:14:26,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:26,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:26,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:26,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:26,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:26,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1808998383, now seen corresponding path program 1 times [2020-06-22 10:14:26,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:26,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:26,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:26,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:14:26,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:14:26,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:14:26,902 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:14:26,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:14:26,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:14:26,903 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2020-06-22 10:14:26,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:14:26,991 INFO L93 Difference]: Finished difference Result 30 states and 52 transitions. [2020-06-22 10:14:26,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:14:26,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 52 transitions. [2020-06-22 10:14:26,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 10:14:26,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 16 states and 24 transitions. [2020-06-22 10:14:26,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-06-22 10:14:26,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-06-22 10:14:26,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 24 transitions. [2020-06-22 10:14:27,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:14:27,000 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2020-06-22 10:14:27,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 24 transitions. [2020-06-22 10:14:27,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-06-22 10:14:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-06-22 10:14:27,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2020-06-22 10:14:27,003 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 23 transitions. [2020-06-22 10:14:27,003 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 23 transitions. [2020-06-22 10:14:27,003 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:14:27,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 23 transitions. [2020-06-22 10:14:27,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-06-22 10:14:27,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:14:27,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:14:27,004 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:14:27,005 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:14:27,005 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRY [83] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 77#L-1 [116] L-1-->L9-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem3] 70#L9-2 [2020-06-22 10:14:27,005 INFO L796 eck$LassoCheckResult]: Loop: 70#L9-2 [59] L9-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 71#L8-1 [122] L8-1-->L8-2: Formula: (and (>= 0 |v_ULTIMATE.start_main_#t~mem2_3|) (not |v_ULTIMATE.start_main_#t~short4_2|)) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 72#L8-2 [77] L8-2-->L8-6: Formula: (not |v_ULTIMATE.start_main_#t~short4_5|) InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} AuxVars[] AssignedVars[] 81#L8-6 [90] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 73#L9 [129] L9-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 74#L10 [65] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 76#L10-1 [155] L10-1-->L9-2: Formula: (and (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~x~0.base_17)) (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem6_6| (- 1)))) |v_#memory_int_13|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13)) InVars {#valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|} OutVars{#valid=|v_#valid_30|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem6] 70#L9-2 [2020-06-22 10:14:27,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:27,006 INFO L82 PathProgramCache]: Analyzing trace with hash 3650, now seen corresponding path program 2 times [2020-06-22 10:14:27,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:27,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:27,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:27,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:27,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:27,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:27,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1837627534, now seen corresponding path program 1 times [2020-06-22 10:14:27,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:27,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:27,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:27,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:14:27,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:27,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:14:27,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:14:27,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:14:27,036 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:14:27,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:14:27,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:14:27,037 INFO L87 Difference]: Start difference. First operand 15 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-06-22 10:14:27,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:14:27,086 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-06-22 10:14:27,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:14:27,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2020-06-22 10:14:27,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 10:14:27,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 19 transitions. [2020-06-22 10:14:27,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-06-22 10:14:27,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-06-22 10:14:27,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2020-06-22 10:14:27,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:14:27,089 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-06-22 10:14:27,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2020-06-22 10:14:27,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-06-22 10:14:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 10:14:27,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-06-22 10:14:27,091 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-06-22 10:14:27,092 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-06-22 10:14:27,092 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:14:27,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-06-22 10:14:27,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 10:14:27,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:14:27,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:14:27,093 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:14:27,093 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:14:27,094 INFO L794 eck$LassoCheckResult]: Stem: 114#ULTIMATE.startENTRY [83] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 113#L-1 [116] L-1-->L9-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem3] 107#L9-2 [2020-06-22 10:14:27,094 INFO L796 eck$LassoCheckResult]: Loop: 107#L9-2 [59] L9-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 108#L8-1 [121] L8-1-->L8-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem2_3|) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 106#L8-2 [76] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 104#L8-3 [73] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 105#L8-4 [127] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 117#L8-6 [90] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 109#L9 [129] L9-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 110#L10 [65] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 112#L10-1 [155] L10-1-->L9-2: Formula: (and (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~x~0.base_17)) (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem6_6| (- 1)))) |v_#memory_int_13|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13)) InVars {#valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|} OutVars{#valid=|v_#valid_30|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem6] 107#L9-2 [2020-06-22 10:14:27,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:27,094 INFO L82 PathProgramCache]: Analyzing trace with hash 3650, now seen corresponding path program 3 times [2020-06-22 10:14:27,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:27,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:27,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:27,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:27,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:27,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:27,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1905334148, now seen corresponding path program 1 times [2020-06-22 10:14:27,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:27,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:27,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:27,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:14:27,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:27,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:27,128 INFO L82 PathProgramCache]: Analyzing trace with hash 2087092835, now seen corresponding path program 1 times [2020-06-22 10:14:27,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:27,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:27,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:27,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:27,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:27,366 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:14:27,367 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:14:27,367 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:14:27,367 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:14:27,367 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:14:27,368 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:14:27,368 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:14:27,368 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:14:27,368 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 10:14:27,368 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:14:27,368 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:14:27,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:27,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:27,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:27,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:27,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:27,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:27,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:27,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:27,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:27,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:27,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:27,905 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:14:27,910 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:14:27,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:27,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:27,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:27,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:27,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:27,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:27,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:27,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:27,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:27,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:27,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:27,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:27,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:27,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:27,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:27,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:27,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:27,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:27,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:27,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:27,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:27,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:27,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:27,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:27,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:27,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:27,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:27,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:27,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:27,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:27,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:27,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:27,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:27,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:27,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:27,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:27,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:27,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:27,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:27,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:27,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:27,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:14:27,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:14:27,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:27,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:27,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:27,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:27,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:27,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:27,941 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:14:27,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:14:27,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:27,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:27,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:27,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:27,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:27,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:27,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:27,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:27,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:27,976 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:14:27,980 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:14:27,980 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:14:27,982 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:14:27,983 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:14:27,983 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:14:27,983 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2020-06-22 10:14:28,014 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 10:14:28,017 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:14:28,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:28,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:14:28,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:14:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:28,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:14:28,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:14:28,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:14:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:28,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:14:28,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:14:28,223 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:14:28,224 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:14:28,231 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:14:28,231 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:14:28,232 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2020-06-22 10:14:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:28,299 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:14:28,299 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 10:14:28,303 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 5 loop predicates [2020-06-22 10:14:28,303 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-06-22 10:14:28,405 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 34 states and 43 transitions. Complement of second has 10 states. [2020-06-22 10:14:28,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-06-22 10:14:28,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 10:14:28,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-06-22 10:14:28,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 9 letters. [2020-06-22 10:14:28,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:14:28,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 11 letters. Loop has 9 letters. [2020-06-22 10:14:28,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:14:28,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 18 letters. [2020-06-22 10:14:28,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:14:28,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2020-06-22 10:14:28,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 10:14:28,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 39 transitions. [2020-06-22 10:14:28,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 10:14:28,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-06-22 10:14:28,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2020-06-22 10:14:28,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:14:28,419 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2020-06-22 10:14:28,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2020-06-22 10:14:28,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2020-06-22 10:14:28,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 10:14:28,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2020-06-22 10:14:28,422 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2020-06-22 10:14:28,422 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2020-06-22 10:14:28,422 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 10:14:28,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2020-06-22 10:14:28,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 10:14:28,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:14:28,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:14:28,424 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:14:28,424 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:14:28,424 INFO L794 eck$LassoCheckResult]: Stem: 312#ULTIMATE.startENTRY [83] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 309#L-1 [115] L-1-->L9-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem3] 298#L9-2 [2020-06-22 10:14:28,425 INFO L796 eck$LassoCheckResult]: Loop: 298#L9-2 [59] L9-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 299#L8-1 [121] L8-1-->L8-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem2_3|) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 296#L8-2 [76] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 292#L8-3 [73] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 293#L8-4 [127] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 317#L8-6 [90] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 318#L9 [129] L9-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 311#L10 [65] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 307#L10-1 [155] L10-1-->L9-2: Formula: (and (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~x~0.base_17)) (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem6_6| (- 1)))) |v_#memory_int_13|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13)) InVars {#valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|} OutVars{#valid=|v_#valid_30|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem6] 298#L9-2 [2020-06-22 10:14:28,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:28,425 INFO L82 PathProgramCache]: Analyzing trace with hash 3649, now seen corresponding path program 1 times [2020-06-22 10:14:28,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:28,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:28,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:28,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:28,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:28,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:28,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1905334148, now seen corresponding path program 2 times [2020-06-22 10:14:28,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:28,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:28,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:28,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:28,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:28,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:28,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2011360956, now seen corresponding path program 1 times [2020-06-22 10:14:28,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:28,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:28,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:28,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:14:28,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:28,650 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:14:28,650 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:14:28,650 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:14:28,650 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:14:28,650 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:14:28,651 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:14:28,651 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:14:28,651 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:14:28,651 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 10:14:28,651 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:14:28,651 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:14:28,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:28,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:28,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:28,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:28,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:28,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:28,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:28,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:28,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:28,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:28,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:29,126 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:14:29,126 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:14:29,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:29,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:29,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:29,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:29,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:29,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:29,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:29,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:29,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:29,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:29,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:29,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:29,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:29,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:29,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:29,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:29,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:29,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:29,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:29,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:29,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:29,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:29,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:29,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:14:29,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:14:29,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:29,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:29,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:29,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:29,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:29,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:29,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:14:29,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:14:29,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:29,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:29,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:29,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:29,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:29,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:29,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:14:29,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:14:29,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:29,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:29,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:29,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:29,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:29,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:29,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:14:29,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:14:29,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:29,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:29,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:29,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:29,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:29,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:29,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:29,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:29,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:29,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:29,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:29,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:29,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:29,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:29,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:29,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:14:29,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:14:29,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:29,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:29,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:29,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:29,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:29,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:29,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:29,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:29,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:29,183 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:14:29,184 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:14:29,184 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:14:29,185 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:14:29,185 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:14:29,185 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:14:29,185 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 Supporting invariants [] [2020-06-22 10:14:29,213 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 10:14:29,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:14:29,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:29,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:14:29,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:14:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:29,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:14:29,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:14:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:14:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:29,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:14:29,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:14:29,380 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:14:29,381 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:14:29,385 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:14:29,386 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:14:29,386 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2020-06-22 10:14:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:29,440 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:14:29,440 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 10:14:29,440 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 5 loop predicates [2020-06-22 10:14:29,440 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-06-22 10:14:29,513 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states and 38 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 50 states and 62 transitions. Complement of second has 10 states. [2020-06-22 10:14:29,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-06-22 10:14:29,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 10:14:29,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-06-22 10:14:29,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 9 letters. [2020-06-22 10:14:29,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:14:29,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 11 letters. Loop has 9 letters. [2020-06-22 10:14:29,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:14:29,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 18 letters. [2020-06-22 10:14:29,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:14:29,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 62 transitions. [2020-06-22 10:14:29,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 10:14:29,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 47 states and 58 transitions. [2020-06-22 10:14:29,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-06-22 10:14:29,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-06-22 10:14:29,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 58 transitions. [2020-06-22 10:14:29,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:14:29,523 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 58 transitions. [2020-06-22 10:14:29,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 58 transitions. [2020-06-22 10:14:29,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2020-06-22 10:14:29,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 10:14:29,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2020-06-22 10:14:29,526 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2020-06-22 10:14:29,526 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2020-06-22 10:14:29,526 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 10:14:29,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2020-06-22 10:14:29,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 10:14:29,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:14:29,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:14:29,527 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:14:29,527 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:14:29,528 INFO L794 eck$LassoCheckResult]: Stem: 531#ULTIMATE.startENTRY [83] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 529#L-1 [114] L-1-->L9-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem3] 527#L9-2 [2020-06-22 10:14:29,528 INFO L796 eck$LassoCheckResult]: Loop: 527#L9-2 [59] L9-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 541#L8-1 [121] L8-1-->L8-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem2_3|) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 540#L8-2 [76] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 539#L8-3 [73] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 538#L8-4 [127] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 537#L8-6 [90] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 536#L9 [129] L9-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 530#L10 [65] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 526#L10-1 [155] L10-1-->L9-2: Formula: (and (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~x~0.base_17)) (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem6_6| (- 1)))) |v_#memory_int_13|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13)) InVars {#valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|} OutVars{#valid=|v_#valid_30|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem6] 527#L9-2 [2020-06-22 10:14:29,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:29,529 INFO L82 PathProgramCache]: Analyzing trace with hash 3648, now seen corresponding path program 1 times [2020-06-22 10:14:29,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:29,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:29,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:29,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:29,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:29,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:29,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1905334148, now seen corresponding path program 3 times [2020-06-22 10:14:29,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:29,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:29,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:29,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:29,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:29,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:29,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1814847451, now seen corresponding path program 1 times [2020-06-22 10:14:29,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:29,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:29,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:29,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:14:29,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:29,793 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:14:29,793 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:14:29,793 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:14:29,793 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:14:29,793 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:14:29,794 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:14:29,794 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:14:29,794 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:14:29,794 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 10:14:29,794 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:14:29,794 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:14:29,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:29,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:29,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:29,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:29,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:29,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:29,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:29,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:29,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:29,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:30,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:30,276 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:14:30,277 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:14:30,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:30,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:30,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:30,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:30,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:30,279 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:14:30,279 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:14:30,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:30,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:30,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:30,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:30,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:30,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:30,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:30,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:30,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:30,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:30,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:30,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:30,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:30,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:30,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:30,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:30,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:30,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:30,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:30,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:30,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:30,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:30,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:30,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:30,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:30,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:30,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:30,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:30,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:30,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:30,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:30,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:30,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:30,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:30,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:30,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:30,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:30,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:30,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:30,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:30,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:30,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:30,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:30,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:30,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:30,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:30,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:30,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:30,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:30,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:30,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:30,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:30,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:30,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:30,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:30,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:30,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:30,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:30,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:30,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:30,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:30,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:30,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:30,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:30,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:30,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:30,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:30,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:30,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:30,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:30,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:30,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:30,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:30,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:30,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:30,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:30,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:30,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:30,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:30,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:30,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:30,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:30,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:30,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:30,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:30,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:30,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:30,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:14:30,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:14:30,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:30,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:30,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:30,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:30,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:30,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:30,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:14:30,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:14:30,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:30,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:30,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:30,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:30,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:30,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:30,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:14:30,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:14:30,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:30,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:30,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:30,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:30,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:30,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:30,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:14:30,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:14:30,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:30,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:30,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:30,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:30,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:30,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:30,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:14:30,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:14:30,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:30,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:30,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:30,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:30,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:30,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:30,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:30,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:30,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:30,339 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:14:30,340 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:14:30,340 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:14:30,340 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:14:30,340 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:14:30,341 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:14:30,341 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2020-06-22 10:14:30,365 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 10:14:30,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:14:30,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:30,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:14:30,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:14:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:30,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:14:30,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:14:30,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:14:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:30,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:14:30,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:14:30,567 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:14:30,568 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:14:30,573 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:14:30,574 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:14:30,574 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2020-06-22 10:14:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:30,633 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:14:30,633 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 10:14:30,633 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 5 loop predicates [2020-06-22 10:14:30,633 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-06-22 10:14:30,710 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states and 38 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 50 states and 62 transitions. Complement of second has 10 states. [2020-06-22 10:14:30,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-06-22 10:14:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 10:14:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-06-22 10:14:30,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 9 letters. [2020-06-22 10:14:30,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:14:30,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 11 letters. Loop has 9 letters. [2020-06-22 10:14:30,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:14:30,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 18 letters. [2020-06-22 10:14:30,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:14:30,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 62 transitions. [2020-06-22 10:14:30,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 10:14:30,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 47 states and 58 transitions. [2020-06-22 10:14:30,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-06-22 10:14:30,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-06-22 10:14:30,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 58 transitions. [2020-06-22 10:14:30,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:14:30,719 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 58 transitions. [2020-06-22 10:14:30,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 58 transitions. [2020-06-22 10:14:30,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2020-06-22 10:14:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 10:14:30,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2020-06-22 10:14:30,721 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2020-06-22 10:14:30,721 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2020-06-22 10:14:30,721 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 10:14:30,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2020-06-22 10:14:30,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 10:14:30,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:14:30,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:14:30,723 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:14:30,723 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:14:30,723 INFO L794 eck$LassoCheckResult]: Stem: 751#ULTIMATE.startENTRY [83] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 749#L-1 [113] L-1-->L9-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem3] 747#L9-2 [2020-06-22 10:14:30,723 INFO L796 eck$LassoCheckResult]: Loop: 747#L9-2 [59] L9-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 761#L8-1 [121] L8-1-->L8-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem2_3|) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 760#L8-2 [76] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 759#L8-3 [73] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 758#L8-4 [127] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 757#L8-6 [90] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 756#L9 [129] L9-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 750#L10 [65] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 746#L10-1 [155] L10-1-->L9-2: Formula: (and (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~x~0.base_17)) (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem6_6| (- 1)))) |v_#memory_int_13|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13)) InVars {#valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|} OutVars{#valid=|v_#valid_30|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem6] 747#L9-2 [2020-06-22 10:14:30,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:30,724 INFO L82 PathProgramCache]: Analyzing trace with hash 3647, now seen corresponding path program 1 times [2020-06-22 10:14:30,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:30,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:30,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:30,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:30,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:30,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:30,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1905334148, now seen corresponding path program 4 times [2020-06-22 10:14:30,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:30,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:30,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:30,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:30,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:30,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:30,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1618333946, now seen corresponding path program 1 times [2020-06-22 10:14:30,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:30,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:30,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:30,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:14:30,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:30,919 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:14:30,919 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:14:30,919 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:14:30,919 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:14:30,920 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:14:30,920 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:14:30,920 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:14:30,920 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:14:30,920 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso [2020-06-22 10:14:30,920 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:14:30,920 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:14:30,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:30,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:30,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:31,072 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2020-06-22 10:14:31,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:31,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:31,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:31,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:31,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:31,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:31,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:31,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:31,412 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:14:31,413 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:14:31,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:31,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:31,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:31,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:31,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:31,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:31,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:31,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:31,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:31,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:31,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:31,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:31,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:31,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:31,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:31,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:31,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:31,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:31,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:31,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:31,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:31,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:31,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:31,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:14:31,420 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:14:31,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:31,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:31,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:31,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:31,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:31,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:31,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:31,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:31,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:31,429 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:14:31,431 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:14:31,431 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:14:31,432 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:14:31,432 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:14:31,432 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:14:31,432 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4 Supporting invariants [] [2020-06-22 10:14:31,455 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 10:14:31,456 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:14:31,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:31,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:14:31,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:14:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:31,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:14:31,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:14:31,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:14:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:31,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:14:31,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:14:31,633 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:14:31,634 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:14:31,638 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:14:31,638 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:14:31,638 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2020-06-22 10:14:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:31,691 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:14:31,691 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 10:14:31,691 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 5 loop predicates [2020-06-22 10:14:31,691 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-06-22 10:14:31,760 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states and 38 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 50 states and 62 transitions. Complement of second has 10 states. [2020-06-22 10:14:31,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-06-22 10:14:31,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 10:14:31,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-06-22 10:14:31,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 9 letters. [2020-06-22 10:14:31,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:14:31,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 11 letters. Loop has 9 letters. [2020-06-22 10:14:31,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:14:31,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 18 letters. [2020-06-22 10:14:31,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:14:31,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 62 transitions. [2020-06-22 10:14:31,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 10:14:31,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 47 states and 58 transitions. [2020-06-22 10:14:31,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-06-22 10:14:31,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-06-22 10:14:31,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 58 transitions. [2020-06-22 10:14:31,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:14:31,768 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 58 transitions. [2020-06-22 10:14:31,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 58 transitions. [2020-06-22 10:14:31,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2020-06-22 10:14:31,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 10:14:31,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2020-06-22 10:14:31,770 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2020-06-22 10:14:31,770 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2020-06-22 10:14:31,770 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 10:14:31,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2020-06-22 10:14:31,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 10:14:31,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:14:31,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:14:31,772 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:14:31,772 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:14:31,772 INFO L794 eck$LassoCheckResult]: Stem: 971#ULTIMATE.startENTRY [83] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 969#L-1 [116] L-1-->L9-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem3] 960#L9-2 [59] L9-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 958#L8-1 [121] L8-1-->L8-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem2_3|) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 956#L8-2 [76] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 952#L8-3 [73] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 953#L8-4 [127] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 974#L8-6 [90] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 962#L9 [63] L9-->L12: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 963#L12 [2020-06-22 10:14:31,773 INFO L796 eck$LassoCheckResult]: Loop: 963#L12 [154] L12-->L13: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_18| v_ULTIMATE.start_main_~x~0.base_16)) (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (store |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_16 (store (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12 |v_ULTIMATE.start_main_#t~nondet7_5|)) |v_#memory_int_11|)) InVars {#valid=|v_#valid_29|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_18|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} OutVars{#valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_18|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~nondet7] 972#L13 [91] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_14| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (= 1 (select |v_#valid_16| v_ULTIMATE.start_main_~y~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_14|, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 973#L13-1 [156] L13-1-->L9-2: Formula: (and (= 1 (select |v_#valid_31| v_ULTIMATE.start_main_~y~0.base_13)) (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem8_6| (- 1)))) |v_#memory_int_15|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_20| v_ULTIMATE.start_main_~y~0.base_13)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 967#L9-2 [59] L9-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 981#L8-1 [121] L8-1-->L8-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem2_3|) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 980#L8-2 [76] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 979#L8-3 [73] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 978#L8-4 [127] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 977#L8-6 [90] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 976#L9 [63] L9-->L12: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 963#L12 [2020-06-22 10:14:31,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:31,773 INFO L82 PathProgramCache]: Analyzing trace with hash 475914215, now seen corresponding path program 1 times [2020-06-22 10:14:31,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:31,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:31,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:31,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:31,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:31,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:31,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1904629489, now seen corresponding path program 1 times [2020-06-22 10:14:31,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:31,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:31,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:31,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:31,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:31,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:31,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1748672139, now seen corresponding path program 1 times [2020-06-22 10:14:31,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:31,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:31,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:31,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:31,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:32,041 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2020-06-22 10:14:32,094 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:14:32,094 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:14:32,094 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:14:32,094 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:14:32,094 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:14:32,094 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:14:32,094 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:14:32,094 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:14:32,094 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso [2020-06-22 10:14:32,095 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:14:32,095 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:14:32,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:32,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:32,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:32,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:32,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:32,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:32,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:32,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:32,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:32,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:32,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:32,563 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:14:32,564 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:14:32,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:32,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:32,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:32,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:32,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:32,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:32,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:32,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:32,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:32,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:32,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:32,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:32,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:32,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:32,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:14:32,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:14:32,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:32,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:32,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:32,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:32,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:32,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:32,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:14:32,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:14:32,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:32,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:32,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:32,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:32,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:32,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:32,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:32,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:32,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:32,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:32,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:32,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:32,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:32,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:32,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:32,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:32,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:32,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:32,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:32,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:32,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:32,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:32,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:32,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:32,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:14:32,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:14:32,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:32,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:32,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:32,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:32,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:32,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:32,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:14:32,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:14:32,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:32,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:32,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:32,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:32,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:32,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:32,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:14:32,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:14:32,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:32,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:32,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:32,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:32,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:32,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:32,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:14:32,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:14:32,603 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:14:32,608 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:14:32,608 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:14:32,609 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:14:32,611 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:14:32,611 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:14:32,611 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_5 Supporting invariants [] [2020-06-22 10:14:32,668 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 10:14:32,671 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:14:32,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:32,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:14:32,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:14:32,721 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 10:14:32,722 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:14:32,725 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:14:32,725 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:14:32,726 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2020-06-22 10:14:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:32,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:14:32,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:14:32,743 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:14:32,744 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:14:32,749 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:14:32,750 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:14:32,750 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 [2020-06-22 10:14:32,771 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:14:32,772 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:14:32,782 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:14:32,782 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:14:32,782 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 10:14:32,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:14:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:32,893 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:14:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:32,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:14:32,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:14:32,947 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:14:32,948 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:14:32,954 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:14:32,955 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:14:32,955 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2020-06-22 10:14:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:32,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:14:32,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:14:32,995 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-06-22 10:14:32,995 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:14:33,003 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:14:33,004 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:14:33,004 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2020-06-22 10:14:33,009 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:14:33,010 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:14:33,019 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:14:33,020 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:14:33,020 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 10:14:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:33,066 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:14:33,066 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-22 10:14:33,067 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2020-06-22 10:14:33,067 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states and 38 transitions. cyclomatic complexity: 10 Second operand 8 states. [2020-06-22 10:14:33,382 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states and 38 transitions. cyclomatic complexity: 10. Second operand 8 states. Result 83 states and 96 transitions. Complement of second has 39 states. [2020-06-22 10:14:33,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 8 non-accepting loop states 2 accepting loop states [2020-06-22 10:14:33,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 10:14:33,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2020-06-22 10:14:33,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 48 transitions. Stem has 9 letters. Loop has 10 letters. [2020-06-22 10:14:33,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:14:33,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 48 transitions. Stem has 19 letters. Loop has 10 letters. [2020-06-22 10:14:33,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:14:33,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 48 transitions. Stem has 9 letters. Loop has 20 letters. [2020-06-22 10:14:33,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:14:33,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 96 transitions. [2020-06-22 10:14:33,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 10:14:33,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 60 states and 72 transitions. [2020-06-22 10:14:33,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-06-22 10:14:33,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-06-22 10:14:33,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 72 transitions. [2020-06-22 10:14:33,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:14:33,392 INFO L706 BuchiCegarLoop]: Abstraction has 60 states and 72 transitions. [2020-06-22 10:14:33,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 72 transitions. [2020-06-22 10:14:33,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2020-06-22 10:14:33,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-06-22 10:14:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2020-06-22 10:14:33,395 INFO L729 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. [2020-06-22 10:14:33,395 INFO L609 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. [2020-06-22 10:14:33,395 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 10:14:33,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 60 transitions. [2020-06-22 10:14:33,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 10:14:33,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:14:33,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:14:33,397 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-06-22 10:14:33,397 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:14:33,398 INFO L794 eck$LassoCheckResult]: Stem: 1326#ULTIMATE.startENTRY [83] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1323#L-1 [116] L-1-->L9-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem3] 1324#L9-2 [59] L9-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 1344#L8-1 [121] L8-1-->L8-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem2_3|) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1342#L8-2 [76] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 1340#L8-3 [73] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1339#L8-4 [127] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1338#L8-6 [90] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 1336#L9 [63] L9-->L12: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 1327#L12 [154] L12-->L13: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_18| v_ULTIMATE.start_main_~x~0.base_16)) (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (store |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_16 (store (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12 |v_ULTIMATE.start_main_#t~nondet7_5|)) |v_#memory_int_11|)) InVars {#valid=|v_#valid_29|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_18|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} OutVars{#valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_18|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~nondet7] 1328#L13 [91] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_14| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (= 1 (select |v_#valid_16| v_ULTIMATE.start_main_~y~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_14|, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 1331#L13-1 [156] L13-1-->L9-2: Formula: (and (= 1 (select |v_#valid_31| v_ULTIMATE.start_main_~y~0.base_13)) (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem8_6| (- 1)))) |v_#memory_int_15|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_20| v_ULTIMATE.start_main_~y~0.base_13)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 1332#L9-2 [59] L9-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 1355#L8-1 [121] L8-1-->L8-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem2_3|) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1354#L8-2 [76] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 1353#L8-3 [73] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1351#L8-4 [127] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1349#L8-6 [90] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 1317#L9 [2020-06-22 10:14:33,399 INFO L796 eck$LassoCheckResult]: Loop: 1317#L9 [129] L9-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 1318#L10 [65] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 1321#L10-1 [155] L10-1-->L9-2: Formula: (and (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~x~0.base_17)) (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem6_6| (- 1)))) |v_#memory_int_13|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13)) InVars {#valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|} OutVars{#valid=|v_#valid_30|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem6] 1313#L9-2 [59] L9-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 1314#L8-1 [121] L8-1-->L8-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem2_3|) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1311#L8-2 [76] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 1307#L8-3 [73] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1308#L8-4 [127] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1333#L8-6 [90] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 1317#L9 [2020-06-22 10:14:33,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:33,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1441882102, now seen corresponding path program 2 times [2020-06-22 10:14:33,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:33,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:33,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:33,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:33,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:33,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:33,426 INFO L82 PathProgramCache]: Analyzing trace with hash 2110938160, now seen corresponding path program 5 times [2020-06-22 10:14:33,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:33,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:33,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:33,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:14:33,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:33,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:33,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1060325817, now seen corresponding path program 1 times [2020-06-22 10:14:33,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:33,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:33,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:33,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:14:33,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:33,815 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2020-06-22 10:14:33,903 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:14:33,903 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:14:33,903 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:14:33,903 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:14:33,904 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:14:33,904 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:14:33,904 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:14:33,904 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:14:33,904 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Lasso [2020-06-22 10:14:33,904 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:14:33,904 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:14:33,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:33,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:33,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:33,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:33,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:33,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:33,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:33,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:33,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:34,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:34,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:14:34,330 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:14:34,331 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:14:34,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:34,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:34,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:34,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:34,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:34,333 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:14:34,333 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:14:34,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:34,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:34,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:34,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:34,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:34,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:34,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:34,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:34,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:34,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:34,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:34,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:34,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:34,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:34,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:34,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:34,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:34,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:34,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:34,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:34,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:34,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:34,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:34,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:34,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:34,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:34,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:34,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:34,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:34,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:34,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:34,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:34,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:34,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:34,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:34,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:34,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:34,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:34,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:34,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:34,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:34,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:34,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:34,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:34,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:34,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:34,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:34,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:34,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:14:34,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:34,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:34,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:34,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:14:34,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:14:34,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:34,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:34,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:34,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:34,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:34,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:34,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:14:34,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:14:34,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:14:34,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:14:34,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:14:34,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:14:34,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:14:34,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:14:34,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:14:34,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:14:34,357 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:14:34,362 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:14:34,362 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 10:14:34,363 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:14:34,364 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:14:34,364 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:14:34,364 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_6 Supporting invariants [] [2020-06-22 10:14:34,389 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 10:14:34,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:14:34,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:34,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:14:34,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:14:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:34,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:14:34,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:14:34,446 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:14:34,447 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:14:34,451 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:14:34,453 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:14:34,453 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2020-06-22 10:14:34,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:14:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:34,517 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:14:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:34,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:14:34,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:14:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:34,599 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:14:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:34,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:14:34,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:14:34,611 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:14:34,611 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:14:34,615 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:14:34,616 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:14:34,616 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2020-06-22 10:14:34,621 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 10:14:34,621 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 5 loop predicates [2020-06-22 10:14:34,621 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 49 states and 60 transitions. cyclomatic complexity: 14 Second operand 7 states. [2020-06-22 10:14:34,762 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 49 states and 60 transitions. cyclomatic complexity: 14. Second operand 7 states. Result 166 states and 198 transitions. Complement of second has 31 states. [2020-06-22 10:14:34,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 8 non-accepting loop states 2 accepting loop states [2020-06-22 10:14:34,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 10:14:34,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2020-06-22 10:14:34,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 39 transitions. Stem has 18 letters. Loop has 9 letters. [2020-06-22 10:14:34,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:14:34,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 39 transitions. Stem has 27 letters. Loop has 9 letters. [2020-06-22 10:14:34,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:14:34,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 39 transitions. Stem has 18 letters. Loop has 18 letters. [2020-06-22 10:14:34,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:14:34,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 198 transitions. [2020-06-22 10:14:34,770 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:14:34,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 0 states and 0 transitions. [2020-06-22 10:14:34,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:14:34,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:14:34,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:14:34,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:14:34,770 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:14:34,770 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:14:34,770 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:14:34,770 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-22 10:14:34,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:14:34,771 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:14:34,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:14:34,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:14:34 BasicIcfg [2020-06-22 10:14:34,777 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:14:34,777 INFO L168 Benchmark]: Toolchain (without parser) took 9696.62 ms. Allocated memory was 649.6 MB in the beginning and 857.2 MB in the end (delta: 207.6 MB). Free memory was 564.2 MB in the beginning and 541.9 MB in the end (delta: 22.3 MB). Peak memory consumption was 229.9 MB. Max. memory is 50.3 GB. [2020-06-22 10:14:34,778 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:14:34,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.99 ms. Allocated memory was 649.6 MB in the beginning and 691.5 MB in the end (delta: 41.9 MB). Free memory was 564.2 MB in the beginning and 655.1 MB in the end (delta: -90.8 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. [2020-06-22 10:14:34,779 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.23 ms. Allocated memory is still 691.5 MB. Free memory was 655.1 MB in the beginning and 653.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:14:34,780 INFO L168 Benchmark]: Boogie Preprocessor took 22.23 ms. Allocated memory is still 691.5 MB. Free memory was 653.7 MB in the beginning and 652.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:14:34,780 INFO L168 Benchmark]: RCFGBuilder took 281.77 ms. Allocated memory is still 691.5 MB. Free memory was 652.4 MB in the beginning and 631.3 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 50.3 GB. [2020-06-22 10:14:34,781 INFO L168 Benchmark]: BlockEncodingV2 took 130.47 ms. Allocated memory is still 691.5 MB. Free memory was 631.3 MB in the beginning and 623.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:14:34,781 INFO L168 Benchmark]: TraceAbstraction took 953.93 ms. Allocated memory is still 691.5 MB. Free memory was 621.9 MB in the beginning and 524.0 MB in the end (delta: 97.9 MB). Peak memory consumption was 97.9 MB. Max. memory is 50.3 GB. [2020-06-22 10:14:34,782 INFO L168 Benchmark]: BuchiAutomizer took 7978.02 ms. Allocated memory was 691.5 MB in the beginning and 857.2 MB in the end (delta: 165.7 MB). Free memory was 524.0 MB in the beginning and 541.9 MB in the end (delta: -17.9 MB). Peak memory consumption was 147.7 MB. Max. memory is 50.3 GB. [2020-06-22 10:14:34,786 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 35 locations, 38 edges - StatisticsResult: Encoded RCFG 28 locations, 50 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 285.99 ms. Allocated memory was 649.6 MB in the beginning and 691.5 MB in the end (delta: 41.9 MB). Free memory was 564.2 MB in the beginning and 655.1 MB in the end (delta: -90.8 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.23 ms. Allocated memory is still 691.5 MB. Free memory was 655.1 MB in the beginning and 653.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 22.23 ms. Allocated memory is still 691.5 MB. Free memory was 653.7 MB in the beginning and 652.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 281.77 ms. Allocated memory is still 691.5 MB. Free memory was 652.4 MB in the beginning and 631.3 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 130.47 ms. Allocated memory is still 691.5 MB. Free memory was 631.3 MB in the beginning and 623.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 953.93 ms. Allocated memory is still 691.5 MB. Free memory was 621.9 MB in the beginning and 524.0 MB in the end (delta: 97.9 MB). Peak memory consumption was 97.9 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 7978.02 ms. Allocated memory was 691.5 MB in the beginning and 857.2 MB in the end (delta: 165.7 MB). Free memory was 524.0 MB in the beginning and 541.9 MB in the end (delta: -17.9 MB). Peak memory consumption was 147.7 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant [2020-06-22 10:14:34,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:14:34,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:14:34,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:14:34,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((\valid[y] == 1 && unknown-#length-unknown[y] == 4) && \valid[x] == 1) && x == 0) && 4 == unknown-#length-unknown[x]) && y == 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 14 error locations. SAFE Result, 0.8s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 37 SDtfs, 150 SDslu, 4 SDs, 0 SdLazy, 154 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 27 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 395 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (2 trivial, 0 deterministic, 6 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 11 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.9s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 5.2s. Construction of modules took 0.4s. Büchi inclusion checks took 2.1s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 64 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 49 states and ocurred in iteration 7. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 101 SDtfs, 316 SDslu, 204 SDs, 0 SdLazy, 494 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital158 mio100 ax100 hnf100 lsp93 ukn78 mio100 lsp40 div100 bol100 ite100 ukn100 eq186 hnf88 smp99 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 10:14:21.837 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:14:35.021 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check