YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 09:37:08,666 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 09:37:08,668 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 09:37:08,681 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 09:37:08,681 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 09:37:08,682 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 09:37:08,683 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 09:37:08,685 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 09:37:08,686 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 09:37:08,687 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 09:37:08,688 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 09:37:08,688 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 09:37:08,689 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 09:37:08,690 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 09:37:08,691 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 09:37:08,692 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 09:37:08,692 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 09:37:08,694 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 09:37:08,696 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 09:37:08,697 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 09:37:08,698 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 09:37:08,699 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 09:37:08,701 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 09:37:08,701 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 09:37:08,701 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 09:37:08,702 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 09:37:08,703 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 09:37:08,703 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 09:37:08,704 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 09:37:08,704 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 09:37:08,705 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 09:37:08,706 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 09:37:08,707 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 09:37:08,707 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 09:37:08,707 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 09:37:08,708 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 09:37:08,708 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 09:37:08,709 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 09:37:08,709 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 09:37:08,709 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 09:37:08,724 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 09:37:08,724 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 09:37:08,725 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 09:37:08,725 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 09:37:08,725 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 09:37:08,725 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:37:08,726 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 09:37:08,726 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 09:37:08,726 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 09:37:08,726 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 09:37:08,726 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 09:37:08,726 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 09:37:08,727 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 09:37:08,728 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 09:37:08,728 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:37:08,728 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 09:37:08,728 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 09:37:08,728 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 09:37:08,729 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 09:37:08,729 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 09:37:08,729 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 09:37:08,729 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 09:37:08,729 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 09:37:08,729 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 09:37:08,730 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:37:08,730 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 09:37:08,730 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 09:37:08,730 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 09:37:08,730 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 09:37:08,755 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 09:37:08,768 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 09:37:08,771 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 09:37:08,773 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 09:37:08,773 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 09:37:08,774 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:37:08,842 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/b0edf1a415b648ab93b11b7aa9019d50/FLAG4e5d77523 [2020-06-22 09:37:09,174 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 09:37:09,175 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:37:09,175 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 09:37:09,182 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/b0edf1a415b648ab93b11b7aa9019d50/FLAG4e5d77523 [2020-06-22 09:37:09,582 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/b0edf1a415b648ab93b11b7aa9019d50 [2020-06-22 09:37:09,594 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 09:37:09,595 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 09:37:09,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 09:37:09,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 09:37:09,600 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 09:37:09,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:37:09" (1/1) ... [2020-06-22 09:37:09,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38c5a305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:37:09, skipping insertion in model container [2020-06-22 09:37:09,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:37:09" (1/1) ... [2020-06-22 09:37:09,612 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 09:37:09,630 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 09:37:09,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:37:09,874 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 09:37:09,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:37:09,910 INFO L195 MainTranslator]: Completed translation [2020-06-22 09:37:09,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:37:09 WrapperNode [2020-06-22 09:37:09,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 09:37:09,912 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 09:37:09,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 09:37:09,912 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 09:37:09,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:37:09" (1/1) ... [2020-06-22 09:37:09,931 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:37:09" (1/1) ... [2020-06-22 09:37:09,956 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 09:37:09,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 09:37:09,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 09:37:09,956 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 09:37:09,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:37:09" (1/1) ... [2020-06-22 09:37:09,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:37:09" (1/1) ... [2020-06-22 09:37:09,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:37:09" (1/1) ... [2020-06-22 09:37:09,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:37:09" (1/1) ... [2020-06-22 09:37:09,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:37:09" (1/1) ... [2020-06-22 09:37:09,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:37:09" (1/1) ... [2020-06-22 09:37:09,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:37:09" (1/1) ... [2020-06-22 09:37:09,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 09:37:09,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 09:37:09,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 09:37:09,983 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 09:37:09,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:37:09" (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 09:37:10,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 09:37:10,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 09:37:10,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 09:37:10,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 09:37:10,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 09:37:10,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 09:37:10,434 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 09:37:10,435 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2020-06-22 09:37:10,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:37:10 BoogieIcfgContainer [2020-06-22 09:37:10,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 09:37:10,437 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 09:37:10,437 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 09:37:10,439 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 09:37:10,440 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:37:10" (1/1) ... [2020-06-22 09:37:10,460 INFO L313 BlockEncoder]: Initial Icfg 80 locations, 85 edges [2020-06-22 09:37:10,462 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 09:37:10,462 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 09:37:10,463 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 09:37:10,463 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:37:10,465 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 09:37:10,466 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 09:37:10,466 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 09:37:10,500 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 09:37:10,548 INFO L200 BlockEncoder]: SBE split 43 edges [2020-06-22 09:37:10,553 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 09:37:10,555 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:37:10,589 INFO L100 BaseMinimizeStates]: Removed 20 edges and 10 locations by large block encoding [2020-06-22 09:37:10,592 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 09:37:10,593 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:37:10,594 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:37:10,594 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 09:37:10,595 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:37:10,595 INFO L313 BlockEncoder]: Encoded RCFG 69 locations, 121 edges [2020-06-22 09:37:10,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:37:10 BasicIcfg [2020-06-22 09:37:10,596 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 09:37:10,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 09:37:10,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 09:37:10,600 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 09:37:10,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 09:37:09" (1/4) ... [2020-06-22 09:37:10,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b7d42d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:37:10, skipping insertion in model container [2020-06-22 09:37:10,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:37:09" (2/4) ... [2020-06-22 09:37:10,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b7d42d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:37:10, skipping insertion in model container [2020-06-22 09:37:10,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:37:10" (3/4) ... [2020-06-22 09:37:10,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b7d42d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:37:10, skipping insertion in model container [2020-06-22 09:37:10,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:37:10" (4/4) ... [2020-06-22 09:37:10,604 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:37:10,614 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 09:37:10,622 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 42 error locations. [2020-06-22 09:37:10,638 INFO L257 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2020-06-22 09:37:10,667 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:37:10,668 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 09:37:10,668 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 09:37:10,668 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:37:10,668 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:37:10,668 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:37:10,668 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 09:37:10,668 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:37:10,669 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 09:37:10,684 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2020-06-22 09:37:10,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:37:10,690 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:37:10,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:37:10,691 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION]=== [2020-06-22 09:37:10,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:10,697 INFO L82 PathProgramCache]: Analyzing trace with hash 170260, now seen corresponding path program 1 times [2020-06-22 09:37:10,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:37:10,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:37:10,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:10,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:37:10,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:10,891 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 09:37:10,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:37:10,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:37:10,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:37:10,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:37:10,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:37:10,915 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 3 states. [2020-06-22 09:37:11,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:37:11,190 INFO L93 Difference]: Finished difference Result 69 states and 121 transitions. [2020-06-22 09:37:11,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:37:11,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:37:11,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:37:11,206 INFO L225 Difference]: With dead ends: 69 [2020-06-22 09:37:11,206 INFO L226 Difference]: Without dead ends: 62 [2020-06-22 09:37:11,210 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 09:37:11,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-06-22 09:37:11,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-06-22 09:37:11,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-06-22 09:37:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 107 transitions. [2020-06-22 09:37:11,253 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 107 transitions. Word has length 3 [2020-06-22 09:37:11,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:37:11,254 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 107 transitions. [2020-06-22 09:37:11,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:37:11,254 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 107 transitions. [2020-06-22 09:37:11,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:37:11,255 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:37:11,255 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:37:11,255 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION]=== [2020-06-22 09:37:11,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:11,255 INFO L82 PathProgramCache]: Analyzing trace with hash 170257, now seen corresponding path program 1 times [2020-06-22 09:37:11,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:37:11,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:37:11,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:11,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:37:11,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:11,291 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 09:37:11,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:37:11,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:37:11,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:37:11,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:37:11,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:37:11,294 INFO L87 Difference]: Start difference. First operand 62 states and 107 transitions. Second operand 3 states. [2020-06-22 09:37:11,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:37:11,460 INFO L93 Difference]: Finished difference Result 62 states and 107 transitions. [2020-06-22 09:37:11,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:37:11,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:37:11,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:37:11,462 INFO L225 Difference]: With dead ends: 62 [2020-06-22 09:37:11,462 INFO L226 Difference]: Without dead ends: 54 [2020-06-22 09:37:11,463 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 09:37:11,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-06-22 09:37:11,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-06-22 09:37:11,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-06-22 09:37:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 92 transitions. [2020-06-22 09:37:11,470 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 92 transitions. Word has length 3 [2020-06-22 09:37:11,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:37:11,470 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 92 transitions. [2020-06-22 09:37:11,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:37:11,471 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 92 transitions. [2020-06-22 09:37:11,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:37:11,471 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:37:11,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:37:11,471 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION]=== [2020-06-22 09:37:11,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:11,472 INFO L82 PathProgramCache]: Analyzing trace with hash 5275217, now seen corresponding path program 1 times [2020-06-22 09:37:11,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:37:11,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:37:11,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:11,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:37:11,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:11,524 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 09:37:11,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:37:11,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:37:11,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:37:11,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:37:11,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:37:11,525 INFO L87 Difference]: Start difference. First operand 54 states and 92 transitions. Second operand 3 states. [2020-06-22 09:37:11,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:37:11,660 INFO L93 Difference]: Finished difference Result 54 states and 92 transitions. [2020-06-22 09:37:11,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:37:11,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:37:11,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:37:11,662 INFO L225 Difference]: With dead ends: 54 [2020-06-22 09:37:11,662 INFO L226 Difference]: Without dead ends: 45 [2020-06-22 09:37:11,663 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 09:37:11,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-06-22 09:37:11,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-06-22 09:37:11,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-06-22 09:37:11,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 74 transitions. [2020-06-22 09:37:11,668 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 74 transitions. Word has length 4 [2020-06-22 09:37:11,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:37:11,668 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 74 transitions. [2020-06-22 09:37:11,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:37:11,668 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 74 transitions. [2020-06-22 09:37:11,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:37:11,669 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:37:11,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:37:11,669 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION]=== [2020-06-22 09:37:11,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:11,670 INFO L82 PathProgramCache]: Analyzing trace with hash 5275219, now seen corresponding path program 1 times [2020-06-22 09:37:11,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:37:11,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:37:11,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:11,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:37:11,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:11,697 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 09:37:11,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:37:11,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:37:11,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:37:11,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:37:11,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:37:11,699 INFO L87 Difference]: Start difference. First operand 45 states and 74 transitions. Second operand 3 states. [2020-06-22 09:37:11,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:37:11,794 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-06-22 09:37:11,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:37:11,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:37:11,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:37:11,795 INFO L225 Difference]: With dead ends: 54 [2020-06-22 09:37:11,795 INFO L226 Difference]: Without dead ends: 45 [2020-06-22 09:37:11,796 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 09:37:11,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-06-22 09:37:11,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-06-22 09:37:11,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-06-22 09:37:11,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2020-06-22 09:37:11,800 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 4 [2020-06-22 09:37:11,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:37:11,801 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2020-06-22 09:37:11,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:37:11,801 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2020-06-22 09:37:11,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:37:11,802 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:37:11,802 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:37:11,802 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION]=== [2020-06-22 09:37:11,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:11,803 INFO L82 PathProgramCache]: Analyzing trace with hash 5275220, now seen corresponding path program 1 times [2020-06-22 09:37:11,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:37:11,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:37:11,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:11,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:37:11,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:11,836 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 09:37:11,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:37:11,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:37:11,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:37:11,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:37:11,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:37:11,838 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand 3 states. [2020-06-22 09:37:11,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:37:11,931 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2020-06-22 09:37:11,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:37:11,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:37:11,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:37:11,933 INFO L225 Difference]: With dead ends: 45 [2020-06-22 09:37:11,933 INFO L226 Difference]: Without dead ends: 36 [2020-06-22 09:37:11,933 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 09:37:11,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-06-22 09:37:11,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-06-22 09:37:11,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-06-22 09:37:11,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 56 transitions. [2020-06-22 09:37:11,937 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 56 transitions. Word has length 4 [2020-06-22 09:37:11,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:37:11,937 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 56 transitions. [2020-06-22 09:37:11,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:37:11,938 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 56 transitions. [2020-06-22 09:37:11,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 09:37:11,938 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:37:11,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:37:11,939 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION]=== [2020-06-22 09:37:11,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:11,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1834734388, now seen corresponding path program 1 times [2020-06-22 09:37:11,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:37:11,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:37:11,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:11,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:37:11,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:11,979 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 09:37:11,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:37:11,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:37:11,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:37:11,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:37:11,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:37:11,980 INFO L87 Difference]: Start difference. First operand 36 states and 56 transitions. Second operand 3 states. [2020-06-22 09:37:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:37:12,055 INFO L93 Difference]: Finished difference Result 36 states and 56 transitions. [2020-06-22 09:37:12,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:37:12,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-06-22 09:37:12,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:37:12,057 INFO L225 Difference]: With dead ends: 36 [2020-06-22 09:37:12,057 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 09:37:12,057 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 09:37:12,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 09:37:12,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-06-22 09:37:12,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 09:37:12,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2020-06-22 09:37:12,061 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 12 [2020-06-22 09:37:12,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:37:12,061 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2020-06-22 09:37:12,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:37:12,062 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2020-06-22 09:37:12,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 09:37:12,062 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:37:12,062 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:37:12,062 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION]=== [2020-06-22 09:37:12,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:12,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1834734386, now seen corresponding path program 1 times [2020-06-22 09:37:12,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:37:12,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:37:12,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:12,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:37:12,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:12,095 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 09:37:12,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:37:12,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:37:12,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:37:12,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:37:12,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:37:12,096 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 3 states. [2020-06-22 09:37:12,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:37:12,136 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2020-06-22 09:37:12,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:37:12,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-06-22 09:37:12,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:37:12,137 INFO L225 Difference]: With dead ends: 36 [2020-06-22 09:37:12,137 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 09:37:12,138 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 09:37:12,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 09:37:12,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-06-22 09:37:12,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 09:37:12,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2020-06-22 09:37:12,141 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 12 [2020-06-22 09:37:12,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:37:12,141 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2020-06-22 09:37:12,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:37:12,141 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2020-06-22 09:37:12,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 09:37:12,142 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:37:12,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:37:12,142 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION]=== [2020-06-22 09:37:12,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:12,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1834734385, now seen corresponding path program 1 times [2020-06-22 09:37:12,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:37:12,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:37:12,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:12,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:37:12,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:12,181 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 09:37:12,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:37:12,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:37:12,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:37:12,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:37:12,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:37:12,183 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 3 states. [2020-06-22 09:37:12,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:37:12,242 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2020-06-22 09:37:12,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:37:12,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-06-22 09:37:12,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:37:12,243 INFO L225 Difference]: With dead ends: 31 [2020-06-22 09:37:12,243 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 09:37:12,244 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 09:37:12,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 09:37:12,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 09:37:12,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 09:37:12,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 09:37:12,244 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2020-06-22 09:37:12,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:37:12,245 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:37:12,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:37:12,245 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:37:12,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 09:37:12,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 09:37:12,278 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2020-06-22 09:37:12,279 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:37:12,279 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2020-06-22 09:37:12,279 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:37:12,279 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-06-22 09:37:12,280 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 09:37:12,280 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 09:37:12,280 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-06-22 09:37:12,280 INFO L448 ceAbstractionStarter]: For program point L11-2(line 11) no Hoare annotation was computed. [2020-06-22 09:37:12,280 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:37:12,280 INFO L448 ceAbstractionStarter]: For program point L11-5(line 11) no Hoare annotation was computed. [2020-06-22 09:37:12,280 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:37:12,280 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:37:12,280 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:37:12,281 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:37:12,281 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 09:37:12,281 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:37:12,281 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 09:37:12,281 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:37:12,281 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:37:12,281 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 09:37:12,281 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 09:37:12,281 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:37:12,281 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2020-06-22 09:37:12,282 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:37:12,282 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-06-22 09:37:12,282 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr36REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 09:37:12,282 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-06-22 09:37:12,282 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 09:37:12,282 INFO L448 ceAbstractionStarter]: For program point L16-2(lines 16 17) no Hoare annotation was computed. [2020-06-22 09:37:12,282 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 09:37:12,282 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 09:37:12,283 INFO L444 ceAbstractionStarter]: At program point L16-4(lines 16 17) the Hoare annotation is: (and (= 0 ULTIMATE.start_gcd_~r~0.offset) (= 4 (select |#length| ULTIMATE.start_gcd_~r~0.base)) (= (select |#valid| ULTIMATE.start_gcd_~x_ref~0.base) 1) (= ULTIMATE.start_gcd_~x_ref~0.offset 0) (= ULTIMATE.start_gcd_~y_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_gcd_~r~0.base) 1) (= (select |#valid| ULTIMATE.start_gcd_~y_ref~0.base) 1) (= (select |#length| ULTIMATE.start_gcd_~x_ref~0.base) 4) (= (select |#length| ULTIMATE.start_gcd_~y_ref~0.base) 4)) [2020-06-22 09:37:12,283 INFO L448 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-06-22 09:37:12,283 INFO L448 ceAbstractionStarter]: For program point L16-5(lines 16 17) no Hoare annotation was computed. [2020-06-22 09:37:12,283 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 09:37:12,283 INFO L448 ceAbstractionStarter]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-06-22 09:37:12,283 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr40REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 09:37:12,284 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr38REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 09:37:12,284 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:37:12,284 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2020-06-22 09:37:12,284 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-06-22 09:37:12,285 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:37:12,285 INFO L448 ceAbstractionStarter]: For program point L17-2(line 17) no Hoare annotation was computed. [2020-06-22 09:37:12,285 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 09:37:12,285 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 21) no Hoare annotation was computed. [2020-06-22 09:37:12,285 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 5 23) no Hoare annotation was computed. [2020-06-22 09:37:12,285 INFO L448 ceAbstractionStarter]: For program point L13-3(lines 13 21) no Hoare annotation was computed. [2020-06-22 09:37:12,285 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2020-06-22 09:37:12,285 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:37:12,286 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-06-22 09:37:12,286 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:37:12,286 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:37:12,286 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:37:12,286 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:37:12,286 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:37:12,286 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:37:12,286 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:37:12,286 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 09:37:12,287 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 09:37:12,287 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:37:12,287 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:37:12,287 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr37REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 09:37:12,287 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 09:37:12,287 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 09:37:12,287 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2020-06-22 09:37:12,287 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 09:37:12,287 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr41REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 09:37:12,287 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr39REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 09:37:12,288 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 09:37:12,297 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:37:12,298 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:37:12,299 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:37:12,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:37:12,305 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:37:12,305 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:37:12,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:37:12 BasicIcfg [2020-06-22 09:37:12,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 09:37:12,308 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 09:37:12,308 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 09:37:12,311 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 09:37:12,312 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:37:12,312 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 09:37:09" (1/5) ... [2020-06-22 09:37:12,313 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71120f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:37:12, skipping insertion in model container [2020-06-22 09:37:12,313 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:37:12,313 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:37:09" (2/5) ... [2020-06-22 09:37:12,313 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71120f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:37:12, skipping insertion in model container [2020-06-22 09:37:12,313 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:37:12,314 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:37:10" (3/5) ... [2020-06-22 09:37:12,314 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71120f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:37:12, skipping insertion in model container [2020-06-22 09:37:12,314 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:37:12,314 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:37:10" (4/5) ... [2020-06-22 09:37:12,314 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71120f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:37:12, skipping insertion in model container [2020-06-22 09:37:12,315 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:37:12,315 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:37:12" (5/5) ... [2020-06-22 09:37:12,316 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:37:12,349 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:37:12,349 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 09:37:12,349 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 09:37:12,349 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:37:12,349 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:37:12,349 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:37:12,349 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 09:37:12,350 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:37:12,350 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 09:37:12,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states. [2020-06-22 09:37:12,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 09:37:12,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:37:12,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:37:12,366 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:37:12,366 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:37:12,366 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 09:37:12,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states. [2020-06-22 09:37:12,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 09:37:12,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:37:12,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:37:12,371 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:37:12,371 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:37:12,377 INFO L794 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue [138] 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] 11#L-1true [252] L-1-->L9: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_gcd_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_gcd_~x_ref~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) (< |v_ULTIMATE.start_gcd_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_gcd_#in~x_1| v_ULTIMATE.start_main_~x~0_1) (= (select |v_#valid_6| |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_gcd_~r~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc2.base_1|) (= |v_ULTIMATE.start_gcd_#t~malloc1.offset_1| 0) (= v_ULTIMATE.start_gcd_~x_1 |v_ULTIMATE.start_gcd_#in~x_1|) (= |v_ULTIMATE.start_gcd_#in~y_1| v_ULTIMATE.start_main_~y~0_1) (< 0 |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) (< |v_ULTIMATE.start_gcd_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_gcd_#t~malloc2.base_1| 1) |v_#valid_3|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_gcd_#t~malloc0.base_1| 4) |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 4) |v_ULTIMATE.start_gcd_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_gcd_~y_1 |v_ULTIMATE.start_gcd_#in~y_1|) (= v_ULTIMATE.start_gcd_~r~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc2.offset_1|) (= v_ULTIMATE.start_gcd_~x_ref~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_gcd_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_gcd_#t~malloc2.offset_1| 0) (= |v_ULTIMATE.start_gcd_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet16_14|) (= v_ULTIMATE.start_gcd_~y_ref~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc1.base_1|) (> |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 0) (< 0 |v_ULTIMATE.start_gcd_#t~malloc2.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_gcd_#t~malloc1.base_1|)) (= 0 (select .cse0 |v_ULTIMATE.start_gcd_#t~malloc2.base_1|)) (= v_ULTIMATE.start_gcd_~y_ref~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet17_14|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_1, ULTIMATE.start_gcd_#t~malloc2.offset=|v_ULTIMATE.start_gcd_#t~malloc2.offset_1|, ULTIMATE.start_gcd_#t~malloc2.base=|v_ULTIMATE.start_gcd_#t~malloc2.base_1|, ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_1|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_1|, ULTIMATE.start_gcd_#t~malloc0.base=|v_ULTIMATE.start_gcd_#t~malloc0.base_1|, ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_1|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_1|, ULTIMATE.start_gcd_#t~malloc1.base=|v_ULTIMATE.start_gcd_#t~malloc1.base_1|, ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_1|, ULTIMATE.start_gcd_#t~malloc0.offset=|v_ULTIMATE.start_gcd_#t~malloc0.offset_1|, ULTIMATE.start_gcd_#in~y=|v_ULTIMATE.start_gcd_#in~y_1|, ULTIMATE.start_gcd_#in~x=|v_ULTIMATE.start_gcd_#in~x_1|, #length=|v_#length_1|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_1, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_1, ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_1|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_1|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_1|, ULTIMATE.start_main_#t~ret18=|v_ULTIMATE.start_main_#t~ret18_1|, ULTIMATE.start_gcd_#t~mem11=|v_ULTIMATE.start_gcd_#t~mem11_1|, ULTIMATE.start_gcd_#t~malloc1.offset=|v_ULTIMATE.start_gcd_#t~malloc1.offset_1|, ULTIMATE.start_gcd_#t~mem12=|v_ULTIMATE.start_gcd_#t~mem12_1|, ULTIMATE.start_gcd_#t~mem13=|v_ULTIMATE.start_gcd_#t~mem13_1|, ULTIMATE.start_gcd_#t~mem14=|v_ULTIMATE.start_gcd_#t~mem14_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_gcd_#t~mem15=|v_ULTIMATE.start_gcd_#t~mem15_1|, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_gcd_~x=v_ULTIMATE.start_gcd_~x_1, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_gcd_~y=v_ULTIMATE.start_gcd_~y_1, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_1, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet16_14|, |v_ULTIMATE.start_main_#t~nondet17_14|] AssignedVars[ULTIMATE.start_gcd_~y_ref~0.offset, ULTIMATE.start_gcd_#t~malloc2.offset, ULTIMATE.start_gcd_#t~malloc2.base, ULTIMATE.start_gcd_#t~mem5, ULTIMATE.start_gcd_#t~mem4, ULTIMATE.start_gcd_#t~malloc0.base, ULTIMATE.start_gcd_#t~mem7, ULTIMATE.start_gcd_#t~mem6, ULTIMATE.start_gcd_#t~malloc1.base, ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_#t~malloc0.offset, ULTIMATE.start_gcd_#in~y, ULTIMATE.start_gcd_#in~x, #length, ULTIMATE.start_gcd_~x_ref~0.base, ULTIMATE.start_gcd_~y_ref~0.base, ULTIMATE.start_gcd_#t~mem9, ULTIMATE.start_gcd_#t~mem8, ULTIMATE.start_gcd_~r~0.base, ULTIMATE.start_main_~x~0, ULTIMATE.start_gcd_#t~mem10, ULTIMATE.start_main_#t~ret18, ULTIMATE.start_gcd_#t~mem11, ULTIMATE.start_gcd_#t~malloc1.offset, ULTIMATE.start_gcd_#t~mem12, ULTIMATE.start_gcd_#t~mem13, ULTIMATE.start_gcd_#t~mem14, ULTIMATE.start_gcd_#t~mem15, ULTIMATE.start_gcd_#res, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_gcd_~x, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_gcd_~y, ULTIMATE.start_gcd_~x_ref~0.offset, ULTIMATE.start_gcd_~r~0.offset] 40#L9true [156] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_gcd_~x_ref~0.base_3)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_gcd_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_3) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_gcd_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_gcd_~x_ref~0.base_3) v_ULTIMATE.start_gcd_~x_ref~0.offset_3 v_ULTIMATE.start_gcd_~x_3)))) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_gcd_~x=v_ULTIMATE.start_gcd_~x_3, #length=|v_#length_5|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_3, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_gcd_~x=v_ULTIMATE.start_gcd_~x_3, #length=|v_#length_5|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_3, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 38#L9-1true [150] L9-1-->L10: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_3) (= 1 (select |v_#valid_9| v_ULTIMATE.start_gcd_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_gcd_~y_ref~0.base_3)) (= (store |v_#memory_int_4| v_ULTIMATE.start_gcd_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_gcd_~y_ref~0.base_3) v_ULTIMATE.start_gcd_~y_ref~0.offset_3 v_ULTIMATE.start_gcd_~y_3)) |v_#memory_int_3|)) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_gcd_~y=v_ULTIMATE.start_gcd_~y_3, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_3} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_gcd_~y=v_ULTIMATE.start_gcd_~y_3, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 12#L10true [121] L10-->L11: Formula: (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_gcd_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_5 4) (select |v_#length_9| v_ULTIMATE.start_gcd_~x_ref~0.base_6)) (= |v_ULTIMATE.start_gcd_#t~mem3_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_gcd_~x_ref~0.base_6) v_ULTIMATE.start_gcd_~x_ref~0.offset_5))) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_6, #valid=|v_#valid_11|, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_5} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_6, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3] 27#L11true [205] L11-->L11-5: Formula: (>= |v_ULTIMATE.start_gcd_#t~mem3_6| 0) InVars {ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_6|} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3] 6#L11-5true [113] L11-5-->L12: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_gcd_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_5) (= 1 (select |v_#valid_17| v_ULTIMATE.start_gcd_~y_ref~0.base_6)) (= |v_ULTIMATE.start_gcd_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_gcd_~y_ref~0.base_6) v_ULTIMATE.start_gcd_~y_ref~0.offset_5))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_5, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_2|, ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_5, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5] 48#L12true [212] L12-->L13-2: Formula: (>= |v_ULTIMATE.start_gcd_#t~mem5_6| 0) InVars {ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_6|} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5] 66#L13-2true [2020-06-22 09:37:12,378 INFO L796 eck$LassoCheckResult]: Loop: 66#L13-2true [192] L13-2-->L13: Formula: (and (= 1 (select |v_#valid_23| v_ULTIMATE.start_gcd_~y_ref~0.base_15)) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_gcd_~y_ref~0.base_15)) (= |v_ULTIMATE.start_gcd_#t~mem7_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_gcd_~y_ref~0.base_15) v_ULTIMATE.start_gcd_~y_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_11)) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_11, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_15, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_11, ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_2|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem7] 67#L13true [196] L13-->L15: Formula: (< 0 |v_ULTIMATE.start_gcd_#t~mem7_6|) InVars {ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_6|} OutVars{ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem7] 17#L15true [126] L15-->L15-1: Formula: (and (= (select |v_#valid_25| v_ULTIMATE.start_gcd_~x_ref~0.base_15) 1) (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_11) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_gcd_~x_ref~0.base_15) v_ULTIMATE.start_gcd_~x_ref~0.offset_11) |v_ULTIMATE.start_gcd_#t~mem8_2|) (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_11 4) (select |v_#length_23| v_ULTIMATE.start_gcd_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_15, #valid=|v_#valid_25|, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_11} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_15, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_2|, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem8] 31#L15-1true [340] L15-1-->L16-4: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~r~0.offset_13 4) (select |v_#length_50| v_ULTIMATE.start_gcd_~r~0.base_18)) (= (select |v_#valid_57| v_ULTIMATE.start_gcd_~r~0.base_18) 1) (= (store |v_#memory_int_36| v_ULTIMATE.start_gcd_~r~0.base_18 (store (select |v_#memory_int_36| v_ULTIMATE.start_gcd_~r~0.base_18) v_ULTIMATE.start_gcd_~r~0.offset_13 |v_ULTIMATE.start_gcd_#t~mem8_6|)) |v_#memory_int_35|) (<= 0 v_ULTIMATE.start_gcd_~r~0.offset_13)) InVars {ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_18, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_36|, #length=|v_#length_50|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_6|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_13} OutVars{ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_18, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_35|, #length=|v_#length_50|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_5|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_13} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_gcd_#t~mem8] 49#L16-4true [174] L16-4-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~r~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_gcd_~r~0.base_6)) (= 1 (select |v_#valid_29| v_ULTIMATE.start_gcd_~r~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~r~0.offset_5) (= |v_ULTIMATE.start_gcd_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_gcd_~r~0.base_6) v_ULTIMATE.start_gcd_~r~0.offset_5))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_6, #valid=|v_#valid_29|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_5} OutVars{ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_6, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_2|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem9] 33#L16-1true [146] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_13) (= |v_ULTIMATE.start_gcd_#t~mem10_2| (select (select |v_#memory_int_18| v_ULTIMATE.start_gcd_~y_ref~0.base_18) v_ULTIMATE.start_gcd_~y_ref~0.offset_13)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_gcd_~y_ref~0.base_18)) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_13 4) (select |v_#length_29| v_ULTIMATE.start_gcd_~y_ref~0.base_18))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_13, #memory_int=|v_#memory_int_18|, #length=|v_#length_29|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_18, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_13, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_18|, #length=|v_#length_29|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_18, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_2|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem10] 51#L16-2true [234] L16-2-->L16-5: Formula: (> |v_ULTIMATE.start_gcd_#t~mem10_4| |v_ULTIMATE.start_gcd_#t~mem9_4|) InVars {ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_4|, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_4|} OutVars{ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_3|, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem9, ULTIMATE.start_gcd_#t~mem10] 46#L16-5true [168] L16-5-->L19: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_17 4) (select |v_#length_37| v_ULTIMATE.start_gcd_~y_ref~0.base_24)) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_17) (= 1 (select |v_#valid_39| v_ULTIMATE.start_gcd_~y_ref~0.base_24)) (= |v_ULTIMATE.start_gcd_#t~mem13_2| (select (select |v_#memory_int_23| v_ULTIMATE.start_gcd_~y_ref~0.base_24) v_ULTIMATE.start_gcd_~y_ref~0.offset_17))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_17, #memory_int=|v_#memory_int_23|, #length=|v_#length_37|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_24, #valid=|v_#valid_39|} OutVars{ULTIMATE.start_gcd_#t~mem13=|v_ULTIMATE.start_gcd_#t~mem13_2|, ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_17, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_23|, #length=|v_#length_37|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_24} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem13] 22#L19true [344] L19-->L20: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_22) (= (select |v_#valid_64| v_ULTIMATE.start_gcd_~x_ref~0.base_29) 1) (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_22 4) (select |v_#length_54| v_ULTIMATE.start_gcd_~x_ref~0.base_29)) (= (store |v_#memory_int_41| v_ULTIMATE.start_gcd_~x_ref~0.base_29 (store (select |v_#memory_int_41| v_ULTIMATE.start_gcd_~x_ref~0.base_29) v_ULTIMATE.start_gcd_~x_ref~0.offset_22 |v_ULTIMATE.start_gcd_#t~mem13_6|)) |v_#memory_int_40|)) InVars {ULTIMATE.start_gcd_#t~mem13=|v_ULTIMATE.start_gcd_#t~mem13_6|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_41|, #length=|v_#length_54|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_29, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_22} OutVars{ULTIMATE.start_gcd_#t~mem13=|v_ULTIMATE.start_gcd_#t~mem13_5|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_40|, #length=|v_#length_54|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_29, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_22} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem13, #memory_int] 41#L20true [159] L20-->L20-1: Formula: (and (= (select |v_#valid_43| v_ULTIMATE.start_gcd_~r~0.base_15) 1) (= |v_ULTIMATE.start_gcd_#t~mem14_2| (select (select |v_#memory_int_26| v_ULTIMATE.start_gcd_~r~0.base_15) v_ULTIMATE.start_gcd_~r~0.offset_11)) (<= (+ v_ULTIMATE.start_gcd_~r~0.offset_11 4) (select |v_#length_41| v_ULTIMATE.start_gcd_~r~0.base_15)) (<= 0 v_ULTIMATE.start_gcd_~r~0.offset_11)) InVars {#memory_int=|v_#memory_int_26|, #length=|v_#length_41|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_15, #valid=|v_#valid_43|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_11} OutVars{ULTIMATE.start_gcd_#t~mem14=|v_ULTIMATE.start_gcd_#t~mem14_2|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_15, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_26|, #length=|v_#length_41|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem14] 39#L20-1true [346] L20-1-->L13-2: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_22) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_22 4) (select |v_#length_56| v_ULTIMATE.start_gcd_~y_ref~0.base_31)) (= (store |v_#memory_int_45| v_ULTIMATE.start_gcd_~y_ref~0.base_31 (store (select |v_#memory_int_45| v_ULTIMATE.start_gcd_~y_ref~0.base_31) v_ULTIMATE.start_gcd_~y_ref~0.offset_22 |v_ULTIMATE.start_gcd_#t~mem14_6|)) |v_#memory_int_44|) (= 1 (select |v_#valid_66| v_ULTIMATE.start_gcd_~y_ref~0.base_31))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_22, ULTIMATE.start_gcd_#t~mem14=|v_ULTIMATE.start_gcd_#t~mem14_6|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_45|, #length=|v_#length_56|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_31} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_22, ULTIMATE.start_gcd_#t~mem14=|v_ULTIMATE.start_gcd_#t~mem14_5|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_44|, #length=|v_#length_56|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_31} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem14, #memory_int] 66#L13-2true [2020-06-22 09:37:12,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:12,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1191654748, now seen corresponding path program 1 times [2020-06-22 09:37:12,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:37:12,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:37:12,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:12,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:37:12,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:12,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:12,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1492953194, now seen corresponding path program 1 times [2020-06-22 09:37:12,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:37:12,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:37:12,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:12,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:37:12,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:12,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:12,464 INFO L82 PathProgramCache]: Analyzing trace with hash 899979539, now seen corresponding path program 1 times [2020-06-22 09:37:12,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:37:12,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:37:12,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:12,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:37:12,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:12,999 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 95 [2020-06-22 09:37:13,122 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-06-22 09:37:13,135 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:37:13,136 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:37:13,136 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:37:13,137 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:37:13,137 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:37:13,137 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:37:13,137 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:37:13,137 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:37:13,137 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 09:37:13,137 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:37:13,138 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:37:13,160 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 09:37:13,166 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 09:37:13,168 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 09:37:13,173 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 09:37:13,175 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 09:37:13,177 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 09:37:13,532 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2020-06-22 09:37:13,652 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2020-06-22 09:37:13,653 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 09:37:13,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 09:37:13,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 09:37:13,659 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 09:37:13,661 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 09:37:13,663 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 09:37:13,665 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 09:37:13,667 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 09:37:13,669 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 09:37:13,671 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 09:37:13,673 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 09:37:13,674 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 09:37:13,676 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 09:37:13,677 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 09:37:13,679 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 09:37:13,680 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 09:37:14,126 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:37:14,132 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:37:14,134 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 09:37:14,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:14,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:14,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:14,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:14,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:14,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:14,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:14,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:14,142 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 09:37:14,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:14,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:14,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:14,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:14,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:14,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:14,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:14,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:14,144 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 09:37:14,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:14,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:14,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:14,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:14,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:14,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:14,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:14,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:14,147 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 09:37:14,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:14,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:14,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:14,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:14,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:14,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:14,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:14,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:14,150 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 09:37:14,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:14,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:14,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:14,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:14,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:14,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:14,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:14,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:14,152 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 09:37:14,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:14,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:14,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:14,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:14,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:14,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:14,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:14,202 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 09:37:14,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:14,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:14,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:14,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:14,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:14,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:14,230 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:37:14,243 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 09:37:14,244 INFO L444 ModelExtractionUtils]: 28 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 09:37:14,246 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:37:14,248 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:37:14,248 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:37:14,248 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_1 Supporting invariants [] [2020-06-22 09:37:14,327 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 09:37:14,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:37:14,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:14,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 09:37:14,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:37:14,431 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2020-06-22 09:37:14,432 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:14,440 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:14,441 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:37:14,441 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2020-06-22 09:37:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:14,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 09:37:14,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:37:14,524 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:14,524 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 1 case distinctions, treesize of input 26 treesize of output 45 [2020-06-22 09:37:14,537 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:14,573 INFO L497 ElimStorePlain]: treesize reduction 16, result has 71.9 percent of original size [2020-06-22 09:37:14,573 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 09:37:14,574 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:34 [2020-06-22 09:37:14,727 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:14,727 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 69 [2020-06-22 09:37:14,733 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:14,780 INFO L497 ElimStorePlain]: treesize reduction 24, result has 72.4 percent of original size [2020-06-22 09:37:14,781 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 09:37:14,781 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:53 [2020-06-22 09:37:14,875 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 09:37:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:15,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 09:37:15,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:37:15,616 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:15,617 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 1 case distinctions, treesize of input 19 treesize of output 42 [2020-06-22 09:37:15,618 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:15,644 INFO L497 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2020-06-22 09:37:15,645 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 09:37:15,645 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2020-06-22 09:37:15,862 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:15,862 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 66 [2020-06-22 09:37:15,866 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:15,903 INFO L497 ElimStorePlain]: treesize reduction 24, result has 68.8 percent of original size [2020-06-22 09:37:15,904 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 09:37:15,904 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:43 [2020-06-22 09:37:16,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:37:16,041 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2020-06-22 09:37:16,042 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:16,064 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:16,065 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 69 [2020-06-22 09:37:16,071 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:16,140 INFO L497 ElimStorePlain]: treesize reduction 37, result has 67.0 percent of original size [2020-06-22 09:37:16,141 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-06-22 09:37:16,142 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:68 [2020-06-22 09:37:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:16,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 19 conjunts are in the unsatisfiable core [2020-06-22 09:37:16,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:37:16,770 INFO L340 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size [2020-06-22 09:37:16,770 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2020-06-22 09:37:16,771 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:16,789 INFO L497 ElimStorePlain]: treesize reduction 20, result has 66.1 percent of original size [2020-06-22 09:37:16,789 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:37:16,789 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2020-06-22 09:37:16,956 INFO L340 Elim1Store]: treesize reduction 24, result has 72.4 percent of original size [2020-06-22 09:37:16,956 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 81 [2020-06-22 09:37:16,960 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:17,009 INFO L497 ElimStorePlain]: treesize reduction 40, result has 61.9 percent of original size [2020-06-22 09:37:17,009 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:37:17,010 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:65 [2020-06-22 09:37:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:18,318 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:37:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:18,330 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:37:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:18,343 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:37:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:18,360 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:37:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:18,373 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:37:18,373 INFO L98 LoopCannibalizer]: 26 predicates before loop cannibalization 46 predicates after loop cannibalization [2020-06-22 09:37:18,377 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 46 loop predicates [2020-06-22 09:37:18,377 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 69 states. Second operand 11 states. [2020-06-22 09:37:23,342 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 69 states.. Second operand 11 states. Result 207 states and 352 transitions. Complement of second has 36 states. [2020-06-22 09:37:23,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 2 stem states 16 non-accepting loop states 2 accepting loop states [2020-06-22 09:37:23,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 09:37:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 238 transitions. [2020-06-22 09:37:23,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 238 transitions. Stem has 8 letters. Loop has 11 letters. [2020-06-22 09:37:23,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:37:23,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 238 transitions. Stem has 19 letters. Loop has 11 letters. [2020-06-22 09:37:23,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:37:23,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 238 transitions. Stem has 8 letters. Loop has 22 letters. [2020-06-22 09:37:23,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:37:23,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 207 states and 352 transitions. [2020-06-22 09:37:23,370 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2020-06-22 09:37:23,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 207 states to 68 states and 82 transitions. [2020-06-22 09:37:23,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2020-06-22 09:37:23,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2020-06-22 09:37:23,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 82 transitions. [2020-06-22 09:37:23,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 09:37:23,374 INFO L706 BuchiCegarLoop]: Abstraction has 68 states and 82 transitions. [2020-06-22 09:37:23,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 82 transitions. [2020-06-22 09:37:23,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 50. [2020-06-22 09:37:23,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-06-22 09:37:23,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2020-06-22 09:37:23,379 INFO L729 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2020-06-22 09:37:23,379 INFO L609 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2020-06-22 09:37:23,379 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 09:37:23,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 63 transitions. [2020-06-22 09:37:23,380 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-06-22 09:37:23,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:37:23,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:37:23,381 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:37:23,381 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:37:23,382 INFO L794 eck$LassoCheckResult]: Stem: 688#ULTIMATE.startENTRY [138] 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] 666#L-1 [252] L-1-->L9: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_gcd_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_gcd_~x_ref~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) (< |v_ULTIMATE.start_gcd_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_gcd_#in~x_1| v_ULTIMATE.start_main_~x~0_1) (= (select |v_#valid_6| |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_gcd_~r~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc2.base_1|) (= |v_ULTIMATE.start_gcd_#t~malloc1.offset_1| 0) (= v_ULTIMATE.start_gcd_~x_1 |v_ULTIMATE.start_gcd_#in~x_1|) (= |v_ULTIMATE.start_gcd_#in~y_1| v_ULTIMATE.start_main_~y~0_1) (< 0 |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) (< |v_ULTIMATE.start_gcd_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_gcd_#t~malloc2.base_1| 1) |v_#valid_3|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_gcd_#t~malloc0.base_1| 4) |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 4) |v_ULTIMATE.start_gcd_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_gcd_~y_1 |v_ULTIMATE.start_gcd_#in~y_1|) (= v_ULTIMATE.start_gcd_~r~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc2.offset_1|) (= v_ULTIMATE.start_gcd_~x_ref~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_gcd_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_gcd_#t~malloc2.offset_1| 0) (= |v_ULTIMATE.start_gcd_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet16_14|) (= v_ULTIMATE.start_gcd_~y_ref~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc1.base_1|) (> |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 0) (< 0 |v_ULTIMATE.start_gcd_#t~malloc2.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_gcd_#t~malloc1.base_1|)) (= 0 (select .cse0 |v_ULTIMATE.start_gcd_#t~malloc2.base_1|)) (= v_ULTIMATE.start_gcd_~y_ref~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet17_14|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_1, ULTIMATE.start_gcd_#t~malloc2.offset=|v_ULTIMATE.start_gcd_#t~malloc2.offset_1|, ULTIMATE.start_gcd_#t~malloc2.base=|v_ULTIMATE.start_gcd_#t~malloc2.base_1|, ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_1|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_1|, ULTIMATE.start_gcd_#t~malloc0.base=|v_ULTIMATE.start_gcd_#t~malloc0.base_1|, ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_1|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_1|, ULTIMATE.start_gcd_#t~malloc1.base=|v_ULTIMATE.start_gcd_#t~malloc1.base_1|, ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_1|, ULTIMATE.start_gcd_#t~malloc0.offset=|v_ULTIMATE.start_gcd_#t~malloc0.offset_1|, ULTIMATE.start_gcd_#in~y=|v_ULTIMATE.start_gcd_#in~y_1|, ULTIMATE.start_gcd_#in~x=|v_ULTIMATE.start_gcd_#in~x_1|, #length=|v_#length_1|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_1, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_1, ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_1|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_1|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_1|, ULTIMATE.start_main_#t~ret18=|v_ULTIMATE.start_main_#t~ret18_1|, ULTIMATE.start_gcd_#t~mem11=|v_ULTIMATE.start_gcd_#t~mem11_1|, ULTIMATE.start_gcd_#t~malloc1.offset=|v_ULTIMATE.start_gcd_#t~malloc1.offset_1|, ULTIMATE.start_gcd_#t~mem12=|v_ULTIMATE.start_gcd_#t~mem12_1|, ULTIMATE.start_gcd_#t~mem13=|v_ULTIMATE.start_gcd_#t~mem13_1|, ULTIMATE.start_gcd_#t~mem14=|v_ULTIMATE.start_gcd_#t~mem14_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_gcd_#t~mem15=|v_ULTIMATE.start_gcd_#t~mem15_1|, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_gcd_~x=v_ULTIMATE.start_gcd_~x_1, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_gcd_~y=v_ULTIMATE.start_gcd_~y_1, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_1, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet16_14|, |v_ULTIMATE.start_main_#t~nondet17_14|] AssignedVars[ULTIMATE.start_gcd_~y_ref~0.offset, ULTIMATE.start_gcd_#t~malloc2.offset, ULTIMATE.start_gcd_#t~malloc2.base, ULTIMATE.start_gcd_#t~mem5, ULTIMATE.start_gcd_#t~mem4, ULTIMATE.start_gcd_#t~malloc0.base, ULTIMATE.start_gcd_#t~mem7, ULTIMATE.start_gcd_#t~mem6, ULTIMATE.start_gcd_#t~malloc1.base, ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_#t~malloc0.offset, ULTIMATE.start_gcd_#in~y, ULTIMATE.start_gcd_#in~x, #length, ULTIMATE.start_gcd_~x_ref~0.base, ULTIMATE.start_gcd_~y_ref~0.base, ULTIMATE.start_gcd_#t~mem9, ULTIMATE.start_gcd_#t~mem8, ULTIMATE.start_gcd_~r~0.base, ULTIMATE.start_main_~x~0, ULTIMATE.start_gcd_#t~mem10, ULTIMATE.start_main_#t~ret18, ULTIMATE.start_gcd_#t~mem11, ULTIMATE.start_gcd_#t~malloc1.offset, ULTIMATE.start_gcd_#t~mem12, ULTIMATE.start_gcd_#t~mem13, ULTIMATE.start_gcd_#t~mem14, ULTIMATE.start_gcd_#t~mem15, ULTIMATE.start_gcd_#res, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_gcd_~x, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_gcd_~y, ULTIMATE.start_gcd_~x_ref~0.offset, ULTIMATE.start_gcd_~r~0.offset] 663#L9 [156] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_gcd_~x_ref~0.base_3)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_gcd_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_3) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_gcd_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_gcd_~x_ref~0.base_3) v_ULTIMATE.start_gcd_~x_ref~0.offset_3 v_ULTIMATE.start_gcd_~x_3)))) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_gcd_~x=v_ULTIMATE.start_gcd_~x_3, #length=|v_#length_5|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_3, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_gcd_~x=v_ULTIMATE.start_gcd_~x_3, #length=|v_#length_5|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_3, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 656#L9-1 [150] L9-1-->L10: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_3) (= 1 (select |v_#valid_9| v_ULTIMATE.start_gcd_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_gcd_~y_ref~0.base_3)) (= (store |v_#memory_int_4| v_ULTIMATE.start_gcd_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_gcd_~y_ref~0.base_3) v_ULTIMATE.start_gcd_~y_ref~0.offset_3 v_ULTIMATE.start_gcd_~y_3)) |v_#memory_int_3|)) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_gcd_~y=v_ULTIMATE.start_gcd_~y_3, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_3} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_gcd_~y=v_ULTIMATE.start_gcd_~y_3, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 657#L10 [121] L10-->L11: Formula: (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_gcd_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_5 4) (select |v_#length_9| v_ULTIMATE.start_gcd_~x_ref~0.base_6)) (= |v_ULTIMATE.start_gcd_#t~mem3_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_gcd_~x_ref~0.base_6) v_ULTIMATE.start_gcd_~x_ref~0.offset_5))) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_6, #valid=|v_#valid_11|, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_5} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_6, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3] 668#L11 [205] L11-->L11-5: Formula: (>= |v_ULTIMATE.start_gcd_#t~mem3_6| 0) InVars {ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_6|} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3] 654#L11-5 [113] L11-5-->L12: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_gcd_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_5) (= 1 (select |v_#valid_17| v_ULTIMATE.start_gcd_~y_ref~0.base_6)) (= |v_ULTIMATE.start_gcd_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_gcd_~y_ref~0.base_6) v_ULTIMATE.start_gcd_~y_ref~0.offset_5))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_5, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_2|, ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_5, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5] 655#L12 [171] L12-->L12-1: Formula: (< |v_ULTIMATE.start_gcd_#t~mem5_4| 0) InVars {ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_4|} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5] 673#L12-1 [165] L12-1-->L12-2: Formula: (and (= 1 (select |v_#valid_19| v_ULTIMATE.start_gcd_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_7) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_gcd_~y_ref~0.base_9)) (= |v_ULTIMATE.start_gcd_#t~mem6_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_gcd_~y_ref~0.base_9) v_ULTIMATE.start_gcd_~y_ref~0.offset_7))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_7, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_9, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_7, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem6] 667#L12-2 [338] L12-2-->L13-2: Formula: (and (= (select |v_#valid_54| v_ULTIMATE.start_gcd_~y_ref~0.base_30) 1) (= (store |v_#memory_int_33| v_ULTIMATE.start_gcd_~y_ref~0.base_30 (store (select |v_#memory_int_33| v_ULTIMATE.start_gcd_~y_ref~0.base_30) v_ULTIMATE.start_gcd_~y_ref~0.offset_21 (- |v_ULTIMATE.start_gcd_#t~mem6_6|))) |v_#memory_int_32|) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_21) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_21 4) (select |v_#length_48| v_ULTIMATE.start_gcd_~y_ref~0.base_30))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_21, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_6|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_33|, #length=|v_#length_48|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_30} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_21, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_5|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_32|, #length=|v_#length_48|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_30} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem6, #memory_int] 659#L13-2 [2020-06-22 09:37:23,382 INFO L796 eck$LassoCheckResult]: Loop: 659#L13-2 [192] L13-2-->L13: Formula: (and (= 1 (select |v_#valid_23| v_ULTIMATE.start_gcd_~y_ref~0.base_15)) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_gcd_~y_ref~0.base_15)) (= |v_ULTIMATE.start_gcd_#t~mem7_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_gcd_~y_ref~0.base_15) v_ULTIMATE.start_gcd_~y_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_11)) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_11, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_15, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_11, ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_2|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem7] 699#L13 [196] L13-->L15: Formula: (< 0 |v_ULTIMATE.start_gcd_#t~mem7_6|) InVars {ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_6|} OutVars{ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem7] 697#L15 [126] L15-->L15-1: Formula: (and (= (select |v_#valid_25| v_ULTIMATE.start_gcd_~x_ref~0.base_15) 1) (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_11) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_gcd_~x_ref~0.base_15) v_ULTIMATE.start_gcd_~x_ref~0.offset_11) |v_ULTIMATE.start_gcd_#t~mem8_2|) (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_11 4) (select |v_#length_23| v_ULTIMATE.start_gcd_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_15, #valid=|v_#valid_25|, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_11} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_15, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_2|, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem8] 695#L15-1 [340] L15-1-->L16-4: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~r~0.offset_13 4) (select |v_#length_50| v_ULTIMATE.start_gcd_~r~0.base_18)) (= (select |v_#valid_57| v_ULTIMATE.start_gcd_~r~0.base_18) 1) (= (store |v_#memory_int_36| v_ULTIMATE.start_gcd_~r~0.base_18 (store (select |v_#memory_int_36| v_ULTIMATE.start_gcd_~r~0.base_18) v_ULTIMATE.start_gcd_~r~0.offset_13 |v_ULTIMATE.start_gcd_#t~mem8_6|)) |v_#memory_int_35|) (<= 0 v_ULTIMATE.start_gcd_~r~0.offset_13)) InVars {ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_18, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_36|, #length=|v_#length_50|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_6|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_13} OutVars{ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_18, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_35|, #length=|v_#length_50|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_5|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_13} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_gcd_#t~mem8] 694#L16-4 [174] L16-4-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~r~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_gcd_~r~0.base_6)) (= 1 (select |v_#valid_29| v_ULTIMATE.start_gcd_~r~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~r~0.offset_5) (= |v_ULTIMATE.start_gcd_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_gcd_~r~0.base_6) v_ULTIMATE.start_gcd_~r~0.offset_5))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_6, #valid=|v_#valid_29|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_5} OutVars{ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_6, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_2|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem9] 693#L16-1 [146] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_13) (= |v_ULTIMATE.start_gcd_#t~mem10_2| (select (select |v_#memory_int_18| v_ULTIMATE.start_gcd_~y_ref~0.base_18) v_ULTIMATE.start_gcd_~y_ref~0.offset_13)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_gcd_~y_ref~0.base_18)) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_13 4) (select |v_#length_29| v_ULTIMATE.start_gcd_~y_ref~0.base_18))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_13, #memory_int=|v_#memory_int_18|, #length=|v_#length_29|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_18, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_13, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_18|, #length=|v_#length_29|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_18, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_2|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem10] 691#L16-2 [234] L16-2-->L16-5: Formula: (> |v_ULTIMATE.start_gcd_#t~mem10_4| |v_ULTIMATE.start_gcd_#t~mem9_4|) InVars {ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_4|, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_4|} OutVars{ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_3|, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem9, ULTIMATE.start_gcd_#t~mem10] 669#L16-5 [168] L16-5-->L19: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_17 4) (select |v_#length_37| v_ULTIMATE.start_gcd_~y_ref~0.base_24)) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_17) (= 1 (select |v_#valid_39| v_ULTIMATE.start_gcd_~y_ref~0.base_24)) (= |v_ULTIMATE.start_gcd_#t~mem13_2| (select (select |v_#memory_int_23| v_ULTIMATE.start_gcd_~y_ref~0.base_24) v_ULTIMATE.start_gcd_~y_ref~0.offset_17))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_17, #memory_int=|v_#memory_int_23|, #length=|v_#length_37|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_24, #valid=|v_#valid_39|} OutVars{ULTIMATE.start_gcd_#t~mem13=|v_ULTIMATE.start_gcd_#t~mem13_2|, ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_17, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_23|, #length=|v_#length_37|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_24} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem13] 670#L19 [344] L19-->L20: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_22) (= (select |v_#valid_64| v_ULTIMATE.start_gcd_~x_ref~0.base_29) 1) (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_22 4) (select |v_#length_54| v_ULTIMATE.start_gcd_~x_ref~0.base_29)) (= (store |v_#memory_int_41| v_ULTIMATE.start_gcd_~x_ref~0.base_29 (store (select |v_#memory_int_41| v_ULTIMATE.start_gcd_~x_ref~0.base_29) v_ULTIMATE.start_gcd_~x_ref~0.offset_22 |v_ULTIMATE.start_gcd_#t~mem13_6|)) |v_#memory_int_40|)) InVars {ULTIMATE.start_gcd_#t~mem13=|v_ULTIMATE.start_gcd_#t~mem13_6|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_41|, #length=|v_#length_54|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_29, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_22} OutVars{ULTIMATE.start_gcd_#t~mem13=|v_ULTIMATE.start_gcd_#t~mem13_5|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_40|, #length=|v_#length_54|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_29, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_22} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem13, #memory_int] 664#L20 [159] L20-->L20-1: Formula: (and (= (select |v_#valid_43| v_ULTIMATE.start_gcd_~r~0.base_15) 1) (= |v_ULTIMATE.start_gcd_#t~mem14_2| (select (select |v_#memory_int_26| v_ULTIMATE.start_gcd_~r~0.base_15) v_ULTIMATE.start_gcd_~r~0.offset_11)) (<= (+ v_ULTIMATE.start_gcd_~r~0.offset_11 4) (select |v_#length_41| v_ULTIMATE.start_gcd_~r~0.base_15)) (<= 0 v_ULTIMATE.start_gcd_~r~0.offset_11)) InVars {#memory_int=|v_#memory_int_26|, #length=|v_#length_41|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_15, #valid=|v_#valid_43|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_11} OutVars{ULTIMATE.start_gcd_#t~mem14=|v_ULTIMATE.start_gcd_#t~mem14_2|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_15, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_26|, #length=|v_#length_41|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem14] 658#L20-1 [346] L20-1-->L13-2: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_22) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_22 4) (select |v_#length_56| v_ULTIMATE.start_gcd_~y_ref~0.base_31)) (= (store |v_#memory_int_45| v_ULTIMATE.start_gcd_~y_ref~0.base_31 (store (select |v_#memory_int_45| v_ULTIMATE.start_gcd_~y_ref~0.base_31) v_ULTIMATE.start_gcd_~y_ref~0.offset_22 |v_ULTIMATE.start_gcd_#t~mem14_6|)) |v_#memory_int_44|) (= 1 (select |v_#valid_66| v_ULTIMATE.start_gcd_~y_ref~0.base_31))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_22, ULTIMATE.start_gcd_#t~mem14=|v_ULTIMATE.start_gcd_#t~mem14_6|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_45|, #length=|v_#length_56|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_31} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_22, ULTIMATE.start_gcd_#t~mem14=|v_ULTIMATE.start_gcd_#t~mem14_5|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_44|, #length=|v_#length_56|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_31} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem14, #memory_int] 659#L13-2 [2020-06-22 09:37:23,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:23,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1576021256, now seen corresponding path program 1 times [2020-06-22 09:37:23,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:37:23,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:37:23,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:23,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:37:23,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:23,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:23,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1492953194, now seen corresponding path program 2 times [2020-06-22 09:37:23,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:37:23,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:37:23,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:23,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:37:23,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:23,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:23,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1560244177, now seen corresponding path program 1 times [2020-06-22 09:37:23,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:37:23,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:37:23,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:23,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:37:23,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:24,022 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 105 [2020-06-22 09:37:24,169 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-06-22 09:37:24,172 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:37:24,172 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:37:24,172 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:37:24,173 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:37:24,173 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:37:24,173 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:37:24,173 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:37:24,173 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:37:24,173 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 09:37:24,173 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:37:24,173 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:37:24,177 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 09:37:24,179 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 09:37:24,181 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 09:37:24,182 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 09:37:24,184 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 09:37:24,186 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 09:37:24,188 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 09:37:24,189 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 09:37:24,191 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 09:37:24,193 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 09:37:24,194 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 09:37:24,196 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 09:37:24,197 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 09:37:24,533 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2020-06-22 09:37:24,642 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2020-06-22 09:37:24,643 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 09:37:24,646 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 09:37:24,647 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 09:37:24,649 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 09:37:24,650 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 09:37:24,651 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 09:37:24,653 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 09:37:24,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 09:37:24,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 09:37:24,658 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 09:37:25,085 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:37:25,085 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:37:25,086 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 09:37:25,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:25,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:25,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:25,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:25,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:25,087 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:25,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:25,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:25,088 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 09:37:25,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:25,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:25,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:25,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:25,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:25,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:25,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:25,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:25,090 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 09:37:25,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:25,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:25,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:25,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:25,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:25,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:25,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:25,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:25,092 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 09:37:25,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:25,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:25,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:25,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:25,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:25,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:25,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:25,096 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 09:37:25,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:25,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:25,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:25,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:25,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:25,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:25,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:25,099 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 09:37:25,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:25,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:25,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:25,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:25,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:25,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:25,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:25,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:25,101 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 09:37:25,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:25,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:25,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:25,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:25,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:25,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:25,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:25,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:25,103 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 09:37:25,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:25,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:25,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:25,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:25,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:25,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:25,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:25,106 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 09:37:25,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:25,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:25,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:25,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:25,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:25,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:25,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:25,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:25,108 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 09:37:25,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:25,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:25,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:25,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:25,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:25,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:25,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:25,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:25,110 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 09:37:25,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:25,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:25,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:25,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:25,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:25,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:25,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:25,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:25,112 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 09:37:25,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:25,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:25,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:25,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:25,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:25,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:25,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:25,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:25,114 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 09:37:25,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:25,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:25,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:25,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:25,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:25,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:25,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:25,118 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 09:37:25,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:25,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:25,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:25,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:25,120 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:25,120 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:25,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:25,125 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 09:37:25,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:25,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:25,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:25,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:25,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:25,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:25,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:25,129 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 09:37:25,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:25,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:25,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:25,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:25,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:25,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:25,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:25,146 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 09:37:25,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:25,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:25,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:25,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:25,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:25,148 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:25,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:25,153 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 09:37:25,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:25,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:25,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:25,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:25,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:25,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:25,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:25,164 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 09:37:25,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:25,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:25,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:25,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:25,166 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:25,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:25,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:25,171 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 09:37:25,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:25,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:25,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:25,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:25,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:25,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:25,189 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:37:25,205 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 09:37:25,206 INFO L444 ModelExtractionUtils]: 24 out of 31 variables were initially zero. Simplification set additionally 5 variables to zero. [2020-06-22 09:37:25,206 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:37:25,207 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:37:25,207 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:37:25,207 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_2 Supporting invariants [] [2020-06-22 09:37:25,290 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 09:37:25,296 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:37:25,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:25,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 09:37:25,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:37:25,350 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2020-06-22 09:37:25,351 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:25,359 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:25,360 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:37:25,360 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2020-06-22 09:37:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:25,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 09:37:25,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:37:25,473 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:25,473 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 1 case distinctions, treesize of input 26 treesize of output 45 [2020-06-22 09:37:25,475 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:25,516 INFO L497 ElimStorePlain]: treesize reduction 16, result has 71.9 percent of original size [2020-06-22 09:37:25,516 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 09:37:25,516 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:34 [2020-06-22 09:37:25,676 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:25,676 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 69 [2020-06-22 09:37:25,680 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:25,740 INFO L497 ElimStorePlain]: treesize reduction 24, result has 72.4 percent of original size [2020-06-22 09:37:25,740 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 09:37:25,741 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:53 [2020-06-22 09:37:25,826 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 09:37:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:26,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 09:37:26,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:37:26,486 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:26,486 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 1 case distinctions, treesize of input 19 treesize of output 42 [2020-06-22 09:37:26,488 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:26,514 INFO L497 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2020-06-22 09:37:26,514 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 09:37:26,515 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2020-06-22 09:37:26,732 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:26,733 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 66 [2020-06-22 09:37:26,736 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:26,776 INFO L497 ElimStorePlain]: treesize reduction 24, result has 68.8 percent of original size [2020-06-22 09:37:26,777 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 09:37:26,777 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:43 [2020-06-22 09:37:26,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:37:26,913 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2020-06-22 09:37:26,914 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:26,937 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:26,937 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 69 [2020-06-22 09:37:26,942 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:27,011 INFO L497 ElimStorePlain]: treesize reduction 37, result has 67.0 percent of original size [2020-06-22 09:37:27,012 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-06-22 09:37:27,013 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:68 [2020-06-22 09:37:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:27,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 19 conjunts are in the unsatisfiable core [2020-06-22 09:37:27,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:37:27,623 INFO L340 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size [2020-06-22 09:37:27,623 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2020-06-22 09:37:27,624 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:27,642 INFO L497 ElimStorePlain]: treesize reduction 20, result has 66.1 percent of original size [2020-06-22 09:37:27,643 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:37:27,643 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2020-06-22 09:37:27,817 INFO L340 Elim1Store]: treesize reduction 24, result has 72.4 percent of original size [2020-06-22 09:37:27,818 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 81 [2020-06-22 09:37:27,820 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:27,872 INFO L497 ElimStorePlain]: treesize reduction 40, result has 61.9 percent of original size [2020-06-22 09:37:27,873 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:37:27,873 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:65 [2020-06-22 09:37:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:29,247 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:37:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:29,260 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:37:29,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:29,274 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:37:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:29,285 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:37:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:29,299 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:37:29,299 INFO L98 LoopCannibalizer]: 26 predicates before loop cannibalization 48 predicates after loop cannibalization [2020-06-22 09:37:29,299 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 48 loop predicates [2020-06-22 09:37:29,300 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 50 states and 63 transitions. cyclomatic complexity: 16 Second operand 11 states. [2020-06-22 09:37:32,205 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 50 states and 63 transitions. cyclomatic complexity: 16. Second operand 11 states. Result 82 states and 99 transitions. Complement of second has 32 states. [2020-06-22 09:37:32,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 2 stem states 14 non-accepting loop states 2 accepting loop states [2020-06-22 09:37:32,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 09:37:32,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 63 transitions. [2020-06-22 09:37:32,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 63 transitions. Stem has 10 letters. Loop has 11 letters. [2020-06-22 09:37:32,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:37:32,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 63 transitions. Stem has 21 letters. Loop has 11 letters. [2020-06-22 09:37:32,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:37:32,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 63 transitions. Stem has 10 letters. Loop has 22 letters. [2020-06-22 09:37:32,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:37:32,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 99 transitions. [2020-06-22 09:37:32,216 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2020-06-22 09:37:32,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 78 states and 94 transitions. [2020-06-22 09:37:32,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2020-06-22 09:37:32,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2020-06-22 09:37:32,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 94 transitions. [2020-06-22 09:37:32,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 09:37:32,220 INFO L706 BuchiCegarLoop]: Abstraction has 78 states and 94 transitions. [2020-06-22 09:37:32,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 94 transitions. [2020-06-22 09:37:32,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 36. [2020-06-22 09:37:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-06-22 09:37:32,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2020-06-22 09:37:32,223 INFO L729 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2020-06-22 09:37:32,223 INFO L609 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2020-06-22 09:37:32,223 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 09:37:32,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 48 transitions. [2020-06-22 09:37:32,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 09:37:32,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:37:32,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:37:32,224 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:37:32,224 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:37:32,225 INFO L794 eck$LassoCheckResult]: Stem: 1188#ULTIMATE.startENTRY [138] 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] 1168#L-1 [252] L-1-->L9: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_gcd_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_gcd_~x_ref~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) (< |v_ULTIMATE.start_gcd_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_gcd_#in~x_1| v_ULTIMATE.start_main_~x~0_1) (= (select |v_#valid_6| |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_gcd_~r~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc2.base_1|) (= |v_ULTIMATE.start_gcd_#t~malloc1.offset_1| 0) (= v_ULTIMATE.start_gcd_~x_1 |v_ULTIMATE.start_gcd_#in~x_1|) (= |v_ULTIMATE.start_gcd_#in~y_1| v_ULTIMATE.start_main_~y~0_1) (< 0 |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) (< |v_ULTIMATE.start_gcd_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_gcd_#t~malloc2.base_1| 1) |v_#valid_3|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_gcd_#t~malloc0.base_1| 4) |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 4) |v_ULTIMATE.start_gcd_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_gcd_~y_1 |v_ULTIMATE.start_gcd_#in~y_1|) (= v_ULTIMATE.start_gcd_~r~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc2.offset_1|) (= v_ULTIMATE.start_gcd_~x_ref~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_gcd_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_gcd_#t~malloc2.offset_1| 0) (= |v_ULTIMATE.start_gcd_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet16_14|) (= v_ULTIMATE.start_gcd_~y_ref~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc1.base_1|) (> |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 0) (< 0 |v_ULTIMATE.start_gcd_#t~malloc2.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_gcd_#t~malloc1.base_1|)) (= 0 (select .cse0 |v_ULTIMATE.start_gcd_#t~malloc2.base_1|)) (= v_ULTIMATE.start_gcd_~y_ref~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet17_14|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_1, ULTIMATE.start_gcd_#t~malloc2.offset=|v_ULTIMATE.start_gcd_#t~malloc2.offset_1|, ULTIMATE.start_gcd_#t~malloc2.base=|v_ULTIMATE.start_gcd_#t~malloc2.base_1|, ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_1|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_1|, ULTIMATE.start_gcd_#t~malloc0.base=|v_ULTIMATE.start_gcd_#t~malloc0.base_1|, ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_1|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_1|, ULTIMATE.start_gcd_#t~malloc1.base=|v_ULTIMATE.start_gcd_#t~malloc1.base_1|, ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_1|, ULTIMATE.start_gcd_#t~malloc0.offset=|v_ULTIMATE.start_gcd_#t~malloc0.offset_1|, ULTIMATE.start_gcd_#in~y=|v_ULTIMATE.start_gcd_#in~y_1|, ULTIMATE.start_gcd_#in~x=|v_ULTIMATE.start_gcd_#in~x_1|, #length=|v_#length_1|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_1, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_1, ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_1|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_1|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_1|, ULTIMATE.start_main_#t~ret18=|v_ULTIMATE.start_main_#t~ret18_1|, ULTIMATE.start_gcd_#t~mem11=|v_ULTIMATE.start_gcd_#t~mem11_1|, ULTIMATE.start_gcd_#t~malloc1.offset=|v_ULTIMATE.start_gcd_#t~malloc1.offset_1|, ULTIMATE.start_gcd_#t~mem12=|v_ULTIMATE.start_gcd_#t~mem12_1|, ULTIMATE.start_gcd_#t~mem13=|v_ULTIMATE.start_gcd_#t~mem13_1|, ULTIMATE.start_gcd_#t~mem14=|v_ULTIMATE.start_gcd_#t~mem14_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_gcd_#t~mem15=|v_ULTIMATE.start_gcd_#t~mem15_1|, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_gcd_~x=v_ULTIMATE.start_gcd_~x_1, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_gcd_~y=v_ULTIMATE.start_gcd_~y_1, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_1, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet16_14|, |v_ULTIMATE.start_main_#t~nondet17_14|] AssignedVars[ULTIMATE.start_gcd_~y_ref~0.offset, ULTIMATE.start_gcd_#t~malloc2.offset, ULTIMATE.start_gcd_#t~malloc2.base, ULTIMATE.start_gcd_#t~mem5, ULTIMATE.start_gcd_#t~mem4, ULTIMATE.start_gcd_#t~malloc0.base, ULTIMATE.start_gcd_#t~mem7, ULTIMATE.start_gcd_#t~mem6, ULTIMATE.start_gcd_#t~malloc1.base, ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_#t~malloc0.offset, ULTIMATE.start_gcd_#in~y, ULTIMATE.start_gcd_#in~x, #length, ULTIMATE.start_gcd_~x_ref~0.base, ULTIMATE.start_gcd_~y_ref~0.base, ULTIMATE.start_gcd_#t~mem9, ULTIMATE.start_gcd_#t~mem8, ULTIMATE.start_gcd_~r~0.base, ULTIMATE.start_main_~x~0, ULTIMATE.start_gcd_#t~mem10, ULTIMATE.start_main_#t~ret18, ULTIMATE.start_gcd_#t~mem11, ULTIMATE.start_gcd_#t~malloc1.offset, ULTIMATE.start_gcd_#t~mem12, ULTIMATE.start_gcd_#t~mem13, ULTIMATE.start_gcd_#t~mem14, ULTIMATE.start_gcd_#t~mem15, ULTIMATE.start_gcd_#res, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_gcd_~x, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_gcd_~y, ULTIMATE.start_gcd_~x_ref~0.offset, ULTIMATE.start_gcd_~r~0.offset] 1165#L9 [156] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_gcd_~x_ref~0.base_3)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_gcd_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_3) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_gcd_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_gcd_~x_ref~0.base_3) v_ULTIMATE.start_gcd_~x_ref~0.offset_3 v_ULTIMATE.start_gcd_~x_3)))) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_gcd_~x=v_ULTIMATE.start_gcd_~x_3, #length=|v_#length_5|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_3, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_gcd_~x=v_ULTIMATE.start_gcd_~x_3, #length=|v_#length_5|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_3, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 1161#L9-1 [150] L9-1-->L10: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_3) (= 1 (select |v_#valid_9| v_ULTIMATE.start_gcd_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_gcd_~y_ref~0.base_3)) (= (store |v_#memory_int_4| v_ULTIMATE.start_gcd_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_gcd_~y_ref~0.base_3) v_ULTIMATE.start_gcd_~y_ref~0.offset_3 v_ULTIMATE.start_gcd_~y_3)) |v_#memory_int_3|)) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_gcd_~y=v_ULTIMATE.start_gcd_~y_3, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_3} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_gcd_~y=v_ULTIMATE.start_gcd_~y_3, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 1162#L10 [121] L10-->L11: Formula: (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_gcd_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_5 4) (select |v_#length_9| v_ULTIMATE.start_gcd_~x_ref~0.base_6)) (= |v_ULTIMATE.start_gcd_#t~mem3_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_gcd_~x_ref~0.base_6) v_ULTIMATE.start_gcd_~x_ref~0.offset_5))) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_6, #valid=|v_#valid_11|, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_5} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_6, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3] 1171#L11 [205] L11-->L11-5: Formula: (>= |v_ULTIMATE.start_gcd_#t~mem3_6| 0) InVars {ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_6|} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3] 1159#L11-5 [113] L11-5-->L12: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_gcd_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_5) (= 1 (select |v_#valid_17| v_ULTIMATE.start_gcd_~y_ref~0.base_6)) (= |v_ULTIMATE.start_gcd_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_gcd_~y_ref~0.base_6) v_ULTIMATE.start_gcd_~y_ref~0.offset_5))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_5, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_2|, ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_5, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5] 1160#L12 [212] L12-->L13-2: Formula: (>= |v_ULTIMATE.start_gcd_#t~mem5_6| 0) InVars {ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_6|} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5] 1170#L13-2 [192] L13-2-->L13: Formula: (and (= 1 (select |v_#valid_23| v_ULTIMATE.start_gcd_~y_ref~0.base_15)) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_gcd_~y_ref~0.base_15)) (= |v_ULTIMATE.start_gcd_#t~mem7_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_gcd_~y_ref~0.base_15) v_ULTIMATE.start_gcd_~y_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_11)) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_11, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_15, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_11, ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_2|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem7] 1190#L13 [196] L13-->L15: Formula: (< 0 |v_ULTIMATE.start_gcd_#t~mem7_6|) InVars {ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_6|} OutVars{ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem7] 1181#L15 [126] L15-->L15-1: Formula: (and (= (select |v_#valid_25| v_ULTIMATE.start_gcd_~x_ref~0.base_15) 1) (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_11) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_gcd_~x_ref~0.base_15) v_ULTIMATE.start_gcd_~x_ref~0.offset_11) |v_ULTIMATE.start_gcd_#t~mem8_2|) (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_11 4) (select |v_#length_23| v_ULTIMATE.start_gcd_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_15, #valid=|v_#valid_25|, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_11} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_15, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_2|, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem8] 1182#L15-1 [340] L15-1-->L16-4: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~r~0.offset_13 4) (select |v_#length_50| v_ULTIMATE.start_gcd_~r~0.base_18)) (= (select |v_#valid_57| v_ULTIMATE.start_gcd_~r~0.base_18) 1) (= (store |v_#memory_int_36| v_ULTIMATE.start_gcd_~r~0.base_18 (store (select |v_#memory_int_36| v_ULTIMATE.start_gcd_~r~0.base_18) v_ULTIMATE.start_gcd_~r~0.offset_13 |v_ULTIMATE.start_gcd_#t~mem8_6|)) |v_#memory_int_35|) (<= 0 v_ULTIMATE.start_gcd_~r~0.offset_13)) InVars {ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_18, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_36|, #length=|v_#length_50|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_6|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_13} OutVars{ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_18, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_35|, #length=|v_#length_50|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_5|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_13} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_gcd_#t~mem8] 1175#L16-4 [2020-06-22 09:37:32,226 INFO L796 eck$LassoCheckResult]: Loop: 1175#L16-4 [174] L16-4-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~r~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_gcd_~r~0.base_6)) (= 1 (select |v_#valid_29| v_ULTIMATE.start_gcd_~r~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~r~0.offset_5) (= |v_ULTIMATE.start_gcd_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_gcd_~r~0.base_6) v_ULTIMATE.start_gcd_~r~0.offset_5))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_6, #valid=|v_#valid_29|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_5} OutVars{ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_6, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_2|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem9] 1155#L16-1 [146] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_13) (= |v_ULTIMATE.start_gcd_#t~mem10_2| (select (select |v_#memory_int_18| v_ULTIMATE.start_gcd_~y_ref~0.base_18) v_ULTIMATE.start_gcd_~y_ref~0.offset_13)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_gcd_~y_ref~0.base_18)) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_13 4) (select |v_#length_29| v_ULTIMATE.start_gcd_~y_ref~0.base_18))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_13, #memory_int=|v_#memory_int_18|, #length=|v_#length_29|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_18, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_13, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_18|, #length=|v_#length_29|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_18, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_2|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem10] 1156#L16-2 [178] L16-2-->L17: Formula: (<= |v_ULTIMATE.start_gcd_#t~mem10_6| |v_ULTIMATE.start_gcd_#t~mem9_6|) InVars {ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_6|, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_6|} OutVars{ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_5|, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem9, ULTIMATE.start_gcd_#t~mem10] 1177#L17 [185] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~r~0.offset_7) (<= (+ v_ULTIMATE.start_gcd_~r~0.offset_7 4) (select |v_#length_31| v_ULTIMATE.start_gcd_~r~0.base_9)) (= |v_ULTIMATE.start_gcd_#t~mem11_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_gcd_~r~0.base_9) v_ULTIMATE.start_gcd_~r~0.offset_7)) (= (select |v_#valid_33| v_ULTIMATE.start_gcd_~r~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_19|, #length=|v_#length_31|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_9, #valid=|v_#valid_33|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_7} OutVars{ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_9, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_19|, #length=|v_#length_31|, ULTIMATE.start_gcd_#t~mem11=|v_ULTIMATE.start_gcd_#t~mem11_2|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem11] 1185#L17-1 [182] L17-1-->L17-2: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_15) (= |v_ULTIMATE.start_gcd_#t~mem12_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_gcd_~y_ref~0.base_21) v_ULTIMATE.start_gcd_~y_ref~0.offset_15)) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_15 4) (select |v_#length_33| v_ULTIMATE.start_gcd_~y_ref~0.base_21)) (= (select |v_#valid_35| v_ULTIMATE.start_gcd_~y_ref~0.base_21) 1)) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_15, #memory_int=|v_#memory_int_20|, #length=|v_#length_33|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_21, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_15, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_20|, #length=|v_#length_33|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_21, ULTIMATE.start_gcd_#t~mem12=|v_ULTIMATE.start_gcd_#t~mem12_2|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem12] 1179#L17-2 [345] L17-2-->L16-4: Formula: (and (= |v_#memory_int_42| (store |v_#memory_int_43| v_ULTIMATE.start_gcd_~r~0.base_19 (store (select |v_#memory_int_43| v_ULTIMATE.start_gcd_~r~0.base_19) v_ULTIMATE.start_gcd_~r~0.offset_14 (+ |v_ULTIMATE.start_gcd_#t~mem11_6| (* (- 1) |v_ULTIMATE.start_gcd_#t~mem12_6|))))) (<= (+ v_ULTIMATE.start_gcd_~r~0.offset_14 4) (select |v_#length_55| v_ULTIMATE.start_gcd_~r~0.base_19)) (<= 0 v_ULTIMATE.start_gcd_~r~0.offset_14) (= 1 (select |v_#valid_65| v_ULTIMATE.start_gcd_~r~0.base_19))) InVars {ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_19, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_43|, #length=|v_#length_55|, ULTIMATE.start_gcd_#t~mem11=|v_ULTIMATE.start_gcd_#t~mem11_6|, ULTIMATE.start_gcd_#t~mem12=|v_ULTIMATE.start_gcd_#t~mem12_6|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_14} OutVars{ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_19, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_42|, #length=|v_#length_55|, ULTIMATE.start_gcd_#t~mem11=|v_ULTIMATE.start_gcd_#t~mem11_5|, ULTIMATE.start_gcd_#t~mem12=|v_ULTIMATE.start_gcd_#t~mem12_5|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_14} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_gcd_#t~mem11, ULTIMATE.start_gcd_#t~mem12] 1175#L16-4 [2020-06-22 09:37:32,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:32,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1528491970, now seen corresponding path program 1 times [2020-06-22 09:37:32,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:37:32,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:37:32,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:32,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:37:32,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:32,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:32,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1714329295, now seen corresponding path program 1 times [2020-06-22 09:37:32,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:37:32,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:37:32,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:32,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:37:32,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:32,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:32,261 INFO L82 PathProgramCache]: Analyzing trace with hash 165922124, now seen corresponding path program 1 times [2020-06-22 09:37:32,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:37:32,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:37:32,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:32,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:37:32,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:37:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:32,715 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 104 [2020-06-22 09:37:32,845 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-06-22 09:37:32,848 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:37:32,848 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:37:32,848 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:37:32,849 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:37:32,849 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:37:32,849 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:37:32,849 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:37:32,849 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:37:32,849 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 09:37:32,849 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:37:32,849 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:37:32,852 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 09:37:32,853 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 09:37:32,855 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 09:37:32,857 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 09:37:32,859 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 09:37:32,860 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 09:37:32,861 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 09:37:32,863 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 09:37:32,864 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 09:37:32,866 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 09:37:32,868 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 09:37:33,124 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2020-06-22 09:37:33,192 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 09:37:33,195 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 09:37:33,196 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 09:37:33,198 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 09:37:33,200 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 09:37:33,201 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 09:37:33,203 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 09:37:33,204 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 09:37:33,206 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 09:37:33,207 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 09:37:33,209 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 09:37:33,563 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:37:33,563 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:37:33,563 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 09:37:33,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:33,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:33,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:33,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:33,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:33,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:33,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:33,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:33,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 09:37:33,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:33,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:33,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:33,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:33,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:33,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:33,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:33,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:33,568 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 09:37:33,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:33,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:33,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:33,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:33,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:33,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:33,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:33,571 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 09:37:33,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:33,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:33,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:33,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:33,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:33,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:33,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:33,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:33,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 09:37:33,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:33,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:33,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:33,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:33,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:33,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:33,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:33,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:33,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 09:37:33,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:33,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:33,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:33,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:33,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:33,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:33,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:33,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:33,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 09:37:33,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:33,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:33,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:33,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:33,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:33,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:33,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:33,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:33,578 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 09:37:33,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:33,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:33,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:33,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:33,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:33,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:33,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:33,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:33,580 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 09:37:33,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:33,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:33,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:33,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:33,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:33,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:33,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:33,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:33,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 09:37:33,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:33,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:37:33,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:33,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:33,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:33,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:37:33,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:37:33,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:33,583 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 09:37:33,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:33,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:33,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:33,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:33,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:33,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:33,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:33,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 09:37:33,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:33,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:33,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:33,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:33,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:33,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:33,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:33,600 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 09:37:33,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:33,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:33,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:33,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:33,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:33,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:33,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:33,608 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 09:37:33,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:33,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:33,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:33,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:33,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:33,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:33,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:33,612 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 09:37:33,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:33,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:33,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:33,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:33,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:33,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:33,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:33,639 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 09:37:33,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:33,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:33,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:33,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:33,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:33,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:33,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:33,643 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 09:37:33,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:33,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:33,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:33,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:33,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:33,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:33,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:37:33,649 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 09:37:33,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:37:33,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:37:33,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:37:33,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:37:33,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:37:33,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:37:33,661 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:37:33,668 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 09:37:33,668 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 09:37:33,669 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:37:33,670 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-06-22 09:37:33,670 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:37:33,670 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_3) = -2*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_3 + 2*v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_3 + 1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_3 - 1 >= 0] [2020-06-22 09:37:33,740 INFO L297 tatePredicateManager]: 18 out of 21 supporting invariants were superfluous and have been removed [2020-06-22 09:37:33,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:37:33,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:37:33,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:37:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:33,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 09:37:33,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:37:33,795 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2020-06-22 09:37:33,796 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:33,802 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:33,802 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:37:33,802 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2020-06-22 09:37:33,817 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-06-22 09:37:33,818 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:37:33,824 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:37:33,824 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 09:37:33,824 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2020-06-22 09:37:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:37:33,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 09:37:33,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:37:33,971 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 09:37:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:34,113 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:37:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:34,122 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:37:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:37:34,129 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:37:34,129 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 9 predicates after loop cannibalization [2020-06-22 09:37:34,129 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 9 loop predicates [2020-06-22 09:37:34,129 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 36 states and 48 transitions. cyclomatic complexity: 14 Second operand 10 states. [2020-06-22 09:37:34,527 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 36 states and 48 transitions. cyclomatic complexity: 14. Second operand 10 states. Result 117 states and 135 transitions. Complement of second has 49 states. [2020-06-22 09:37:34,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 4 stem states 12 non-accepting loop states 1 accepting loop states [2020-06-22 09:37:34,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 09:37:34,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 61 transitions. [2020-06-22 09:37:34,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 61 transitions. Stem has 12 letters. Loop has 6 letters. [2020-06-22 09:37:34,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:37:34,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 61 transitions. Stem has 18 letters. Loop has 6 letters. [2020-06-22 09:37:34,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:37:34,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 61 transitions. Stem has 12 letters. Loop has 12 letters. [2020-06-22 09:37:34,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:37:34,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 135 transitions. [2020-06-22 09:37:34,539 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:37:34,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 0 states and 0 transitions. [2020-06-22 09:37:34,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 09:37:34,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 09:37:34,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 09:37:34,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:37:34,540 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:37:34,540 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:37:34,540 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:37:34,540 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 09:37:34,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:37:34,540 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:37:34,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 09:37:34,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:37:34 BasicIcfg [2020-06-22 09:37:34,547 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 09:37:34,548 INFO L168 Benchmark]: Toolchain (without parser) took 24953.49 ms. Allocated memory was 649.6 MB in the beginning and 1.0 GB in the end (delta: 390.1 MB). Free memory was 564.2 MB in the beginning and 792.2 MB in the end (delta: -228.0 MB). Peak memory consumption was 162.1 MB. Max. memory is 50.3 GB. [2020-06-22 09:37:34,548 INFO L168 Benchmark]: CDTParser took 0.16 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 09:37:34,549 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.55 ms. Allocated memory is still 649.6 MB. Free memory was 564.2 MB in the beginning and 613.1 MB in the end (delta: -48.9 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. [2020-06-22 09:37:34,549 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.36 ms. Allocated memory is still 649.6 MB. Free memory was 613.1 MB in the beginning and 610.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 09:37:34,550 INFO L168 Benchmark]: Boogie Preprocessor took 25.86 ms. Allocated memory is still 649.6 MB. Free memory was 610.4 MB in the beginning and 609.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 09:37:34,550 INFO L168 Benchmark]: RCFGBuilder took 454.11 ms. Allocated memory is still 649.6 MB. Free memory was 609.0 MB in the beginning and 576.1 MB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 50.3 GB. [2020-06-22 09:37:34,550 INFO L168 Benchmark]: BlockEncodingV2 took 159.02 ms. Allocated memory is still 649.6 MB. Free memory was 576.1 MB in the beginning and 561.3 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 50.3 GB. [2020-06-22 09:37:34,551 INFO L168 Benchmark]: TraceAbstraction took 1710.92 ms. Allocated memory is still 649.6 MB. Free memory was 561.3 MB in the beginning and 356.2 MB in the end (delta: 205.1 MB). Peak memory consumption was 205.1 MB. Max. memory is 50.3 GB. [2020-06-22 09:37:34,551 INFO L168 Benchmark]: BuchiAutomizer took 22239.23 ms. Allocated memory was 649.6 MB in the beginning and 1.0 GB in the end (delta: 390.1 MB). Free memory was 356.2 MB in the beginning and 792.2 MB in the end (delta: -436.0 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:37:34,554 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 80 locations, 85 edges - StatisticsResult: Encoded RCFG 69 locations, 121 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 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 314.55 ms. Allocated memory is still 649.6 MB. Free memory was 564.2 MB in the beginning and 613.1 MB in the end (delta: -48.9 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 44.36 ms. Allocated memory is still 649.6 MB. Free memory was 613.1 MB in the beginning and 610.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.86 ms. Allocated memory is still 649.6 MB. Free memory was 610.4 MB in the beginning and 609.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 454.11 ms. Allocated memory is still 649.6 MB. Free memory was 609.0 MB in the beginning and 576.1 MB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 159.02 ms. Allocated memory is still 649.6 MB. Free memory was 576.1 MB in the beginning and 561.3 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1710.92 ms. Allocated memory is still 649.6 MB. Free memory was 561.3 MB in the beginning and 356.2 MB in the end (delta: 205.1 MB). Peak memory consumption was 205.1 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 22239.23 ms. Allocated memory was 649.6 MB in the beginning and 1.0 GB in the end (delta: 390.1 MB). Free memory was 356.2 MB in the beginning and 792.2 MB in the end (delta: -436.0 MB). There was no memory consumed. 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 #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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: 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: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: 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: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: 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: 19]: 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: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: 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: 19]: 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: 20]: 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 - AllSpecificationsHoldResult: All specifications hold 42 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant [2020-06-22 09:37:34,563 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:37:34,563 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:37:34,563 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:37:34,564 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:37:34,564 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:37:34,564 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((0 == r && 4 == unknown-#length-unknown[r]) && \valid[x_ref] == 1) && x_ref == 0) && y_ref == 0) && \valid[r] == 1) && \valid[y_ref] == 1) && unknown-#length-unknown[x_ref] == 4) && unknown-#length-unknown[y_ref] == 4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 69 locations, 42 error locations. SAFE Result, 1.6s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 66 SDtfs, 416 SDslu, 5 SDs, 0 SdLazy, 455 SolverSat, 132 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred 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, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 2046 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 3 terminating modules (0 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 20 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 18 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2 * unknown-#memory_int-unknown[r][r] + 1 and consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 5.3s. Construction of modules took 3.3s. Büchi inclusion checks took 13.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 60 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 50 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 36 SDtfs, 1939 SDslu, 108 SDs, 0 SdLazy, 3992 SolverSat, 389 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital386 mio100 ax100 hnf100 lsp97 ukn48 mio100 lsp36 div100 bol100 ite100 ukn100 eq179 hnf88 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 49ms VariablesStem: 11 VariablesLoop: 9 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 09:37:06.376 ----------------------------------------------- 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 09:37:34.790 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check