YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:48:07,656 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:48:07,658 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:48:07,669 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:48:07,669 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:48:07,670 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:48:07,671 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:48:07,672 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:48:07,674 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:48:07,675 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:48:07,675 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:48:07,676 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:48:07,676 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:48:07,677 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:48:07,678 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:48:07,679 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:48:07,680 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:48:07,681 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:48:07,683 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:48:07,685 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:48:07,686 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:48:07,687 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:48:07,689 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:48:07,689 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:48:07,689 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:48:07,690 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:48:07,690 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:48:07,691 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:48:07,691 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:48:07,692 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:48:07,692 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:48:07,693 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:48:07,694 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:48:07,694 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:48:07,695 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:48:07,695 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:48:07,695 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:48:07,696 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:48:07,696 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:48:07,697 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 10:48:07,710 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:48:07,711 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:48:07,712 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:48:07,712 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:48:07,712 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:48:07,712 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:48:07,712 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:48:07,713 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:48:07,713 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:48:07,713 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:48:07,713 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:48:07,713 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:48:07,714 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:48:07,714 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:48:07,714 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:48:07,714 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:48:07,714 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:48:07,714 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:48:07,715 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:48:07,715 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:48:07,715 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:48:07,715 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:48:07,715 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:48:07,715 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:48:07,716 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:48:07,716 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:48:07,716 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:48:07,716 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:48:07,716 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:48:07,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:48:07,756 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:48:07,759 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:48:07,760 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:48:07,761 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:48:07,761 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 10:48:07,830 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/62c1708abf9a4da385b47c2c82260c1a/FLAG734cb6e87 [2020-06-22 10:48:08,163 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:48:08,164 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 10:48:08,164 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:48:08,171 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/62c1708abf9a4da385b47c2c82260c1a/FLAG734cb6e87 [2020-06-22 10:48:08,568 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/62c1708abf9a4da385b47c2c82260c1a [2020-06-22 10:48:08,579 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:48:08,581 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:48:08,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:48:08,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:48:08,585 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:48:08,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:48:08" (1/1) ... [2020-06-22 10:48:08,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ebb53da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:08, skipping insertion in model container [2020-06-22 10:48:08,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:48:08" (1/1) ... [2020-06-22 10:48:08,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:48:08,614 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:48:08,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:48:08,840 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:48:08,858 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:48:08,873 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:48:08,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:08 WrapperNode [2020-06-22 10:48:08,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:48:08,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:48:08,875 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:48:08,875 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:48:08,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:08" (1/1) ... [2020-06-22 10:48:08,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:08" (1/1) ... [2020-06-22 10:48:08,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:48:08,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:48:08,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:48:08,915 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:48:08,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:08" (1/1) ... [2020-06-22 10:48:08,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:08" (1/1) ... [2020-06-22 10:48:08,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:08" (1/1) ... [2020-06-22 10:48:08,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:08" (1/1) ... [2020-06-22 10:48:08,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:08" (1/1) ... [2020-06-22 10:48:08,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:08" (1/1) ... [2020-06-22 10:48:08,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:08" (1/1) ... [2020-06-22 10:48:08,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:48:08,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:48:08,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:48:08,938 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:48:08,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:08" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:48:09,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:48:09,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:48:09,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:48:09,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:48:09,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:48:09,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:48:09,281 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:48:09,281 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2020-06-22 10:48:09,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:48:09 BoogieIcfgContainer [2020-06-22 10:48:09,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:48:09,283 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:48:09,284 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:48:09,286 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:48:09,286 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:48:09" (1/1) ... [2020-06-22 10:48:09,305 INFO L313 BlockEncoder]: Initial Icfg 52 locations, 56 edges [2020-06-22 10:48:09,306 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:48:09,307 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:48:09,308 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:48:09,308 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:48:09,310 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:48:09,311 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:48:09,311 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:48:09,340 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:48:09,372 INFO L200 BlockEncoder]: SBE split 27 edges [2020-06-22 10:48:09,377 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 10:48:09,379 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:48:09,423 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-06-22 10:48:09,426 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-06-22 10:48:09,427 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:48:09,428 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:48:09,428 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:48:09,429 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:48:09,429 INFO L313 BlockEncoder]: Encoded RCFG 44 locations, 74 edges [2020-06-22 10:48:09,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:48:09 BasicIcfg [2020-06-22 10:48:09,430 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:48:09,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:48:09,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:48:09,434 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:48:09,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:48:08" (1/4) ... [2020-06-22 10:48:09,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@406c036c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:48:09, skipping insertion in model container [2020-06-22 10:48:09,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:08" (2/4) ... [2020-06-22 10:48:09,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@406c036c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:48:09, skipping insertion in model container [2020-06-22 10:48:09,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:48:09" (3/4) ... [2020-06-22 10:48:09,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@406c036c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:48:09, skipping insertion in model container [2020-06-22 10:48:09,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:48:09" (4/4) ... [2020-06-22 10:48:09,438 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:48:09,448 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:48:09,456 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 26 error locations. [2020-06-22 10:48:09,472 INFO L257 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2020-06-22 10:48:09,500 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:48:09,501 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:48:09,501 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:48:09,501 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:48:09,502 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:48:09,502 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:48:09,502 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:48:09,502 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:48:09,502 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:48:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-06-22 10:48:09,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:48:09,523 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:48:09,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:48:09,524 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION]=== [2020-06-22 10:48:09,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:09,529 INFO L82 PathProgramCache]: Analyzing trace with hash 134090, now seen corresponding path program 1 times [2020-06-22 10:48:09,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:09,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:09,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:09,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:09,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:09,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:48:09,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:48:09,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:48:09,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:48:09,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:48:09,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:48:09,725 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-06-22 10:48:09,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:48:09,905 INFO L93 Difference]: Finished difference Result 44 states and 74 transitions. [2020-06-22 10:48:09,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:48:09,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:48:09,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:48:09,921 INFO L225 Difference]: With dead ends: 44 [2020-06-22 10:48:09,921 INFO L226 Difference]: Without dead ends: 38 [2020-06-22 10:48:09,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:48:09,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-06-22 10:48:09,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-06-22 10:48:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-06-22 10:48:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 62 transitions. [2020-06-22 10:48:09,964 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 62 transitions. Word has length 3 [2020-06-22 10:48:09,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:48:09,965 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 62 transitions. [2020-06-22 10:48:09,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:48:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 62 transitions. [2020-06-22 10:48:09,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:48:09,966 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:48:09,966 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:48:09,967 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION]=== [2020-06-22 10:48:09,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:09,967 INFO L82 PathProgramCache]: Analyzing trace with hash 134092, now seen corresponding path program 1 times [2020-06-22 10:48:09,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:09,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:09,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:09,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:09,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:09,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:48:09,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:48:09,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:48:09,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:48:09,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:48:09,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:48:09,993 INFO L87 Difference]: Start difference. First operand 38 states and 62 transitions. Second operand 3 states. [2020-06-22 10:48:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:48:10,069 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2020-06-22 10:48:10,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:48:10,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:48:10,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:48:10,071 INFO L225 Difference]: With dead ends: 44 [2020-06-22 10:48:10,071 INFO L226 Difference]: Without dead ends: 38 [2020-06-22 10:48:10,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:48:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-06-22 10:48:10,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-06-22 10:48:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-06-22 10:48:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2020-06-22 10:48:10,077 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 3 [2020-06-22 10:48:10,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:48:10,078 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2020-06-22 10:48:10,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:48:10,078 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2020-06-22 10:48:10,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:48:10,078 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:48:10,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:48:10,079 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION]=== [2020-06-22 10:48:10,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:10,079 INFO L82 PathProgramCache]: Analyzing trace with hash 134093, now seen corresponding path program 1 times [2020-06-22 10:48:10,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:10,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:10,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:10,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:10,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:48:10,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:48:10,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:48:10,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:48:10,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:48:10,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:48:10,162 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand 3 states. [2020-06-22 10:48:10,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:48:10,244 INFO L93 Difference]: Finished difference Result 38 states and 56 transitions. [2020-06-22 10:48:10,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:48:10,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:48:10,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:48:10,245 INFO L225 Difference]: With dead ends: 38 [2020-06-22 10:48:10,245 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 10:48:10,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:48:10,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 10:48:10,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-06-22 10:48:10,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 10:48:10,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. [2020-06-22 10:48:10,250 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 49 transitions. Word has length 3 [2020-06-22 10:48:10,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:48:10,251 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 49 transitions. [2020-06-22 10:48:10,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:48:10,251 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 49 transitions. [2020-06-22 10:48:10,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:48:10,251 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:48:10,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:48:10,252 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION]=== [2020-06-22 10:48:10,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:10,252 INFO L82 PathProgramCache]: Analyzing trace with hash 4155261, now seen corresponding path program 1 times [2020-06-22 10:48:10,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:10,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:10,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:10,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:48:10,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:48:10,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:48:10,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:48:10,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:48:10,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:48:10,287 INFO L87 Difference]: Start difference. First operand 31 states and 49 transitions. Second operand 3 states. [2020-06-22 10:48:10,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:48:10,367 INFO L93 Difference]: Finished difference Result 31 states and 49 transitions. [2020-06-22 10:48:10,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:48:10,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:48:10,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:48:10,369 INFO L225 Difference]: With dead ends: 31 [2020-06-22 10:48:10,369 INFO L226 Difference]: Without dead ends: 24 [2020-06-22 10:48:10,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:48:10,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-06-22 10:48:10,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-06-22 10:48:10,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 10:48:10,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2020-06-22 10:48:10,373 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 4 [2020-06-22 10:48:10,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:48:10,373 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2020-06-22 10:48:10,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:48:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2020-06-22 10:48:10,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:48:10,374 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:48:10,374 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:48:10,375 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION]=== [2020-06-22 10:48:10,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:10,375 INFO L82 PathProgramCache]: Analyzing trace with hash 4155259, now seen corresponding path program 1 times [2020-06-22 10:48:10,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:10,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:10,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:10,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:10,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:48:10,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:48:10,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:48:10,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:48:10,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:48:10,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:48:10,404 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 3 states. [2020-06-22 10:48:10,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:48:10,482 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2020-06-22 10:48:10,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:48:10,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:48:10,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:48:10,483 INFO L225 Difference]: With dead ends: 24 [2020-06-22 10:48:10,483 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:48:10,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:48:10,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:48:10,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:48:10,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:48:10,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:48:10,484 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2020-06-22 10:48:10,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:48:10,484 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:48:10,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:48:10,485 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:48:10,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:48:10,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:48:10,541 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:48:10,541 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:48:10,541 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:48:10,541 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:48:10,541 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 10:48:10,541 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:48:10,542 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:48:10,542 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:48:10,542 INFO L448 ceAbstractionStarter]: For program point L11(lines 11 21) no Hoare annotation was computed. [2020-06-22 10:48:10,542 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 10:48:10,542 INFO L444 ceAbstractionStarter]: At program point L11-2(lines 10 21) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0)) [2020-06-22 10:48:10,543 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:48:10,543 INFO L448 ceAbstractionStarter]: For program point L11-3(lines 11 21) no Hoare annotation was computed. [2020-06-22 10:48:10,543 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:48:10,543 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:48:10,543 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:48:10,543 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 10:48:10,543 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:48:10,543 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2020-06-22 10:48:10,544 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2020-06-22 10:48:10,544 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 10:48:10,544 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:48:10,544 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:48:10,544 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:48:10,544 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:48:10,544 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 10:48:10,544 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:48:10,545 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:48:10,545 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 10:48:10,545 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 13 19) no Hoare annotation was computed. [2020-06-22 10:48:10,545 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:48:10,545 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 10:48:10,546 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 12 19) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0)) [2020-06-22 10:48:10,546 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2020-06-22 10:48:10,546 INFO L448 ceAbstractionStarter]: For program point L13-4(lines 13 19) no Hoare annotation was computed. [2020-06-22 10:48:10,546 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-06-22 10:48:10,546 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:48:10,546 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:48:10,546 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:48:10,546 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:48:10,547 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2020-06-22 10:48:10,547 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-06-22 10:48:10,547 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2020-06-22 10:48:10,547 INFO L448 ceAbstractionStarter]: For program point L14-1(lines 14 17) no Hoare annotation was computed. [2020-06-22 10:48:10,547 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:48:10,556 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:10,557 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:10,563 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:10,564 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:10,565 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:10,566 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:10,567 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:10,567 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:10,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:48:10 BasicIcfg [2020-06-22 10:48:10,569 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:48:10,570 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:48:10,570 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:48:10,574 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:48:10,574 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:48:10,575 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:48:08" (1/5) ... [2020-06-22 10:48:10,575 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@743df28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:48:10, skipping insertion in model container [2020-06-22 10:48:10,575 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:48:10,575 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:08" (2/5) ... [2020-06-22 10:48:10,576 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@743df28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:48:10, skipping insertion in model container [2020-06-22 10:48:10,576 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:48:10,576 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:48:09" (3/5) ... [2020-06-22 10:48:10,576 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@743df28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:48:10, skipping insertion in model container [2020-06-22 10:48:10,576 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:48:10,576 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:48:09" (4/5) ... [2020-06-22 10:48:10,577 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@743df28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:48:10, skipping insertion in model container [2020-06-22 10:48:10,578 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:48:10,578 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:48:10" (5/5) ... [2020-06-22 10:48:10,580 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:48:10,602 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:48:10,603 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:48:10,603 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:48:10,603 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:48:10,603 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:48:10,603 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:48:10,603 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:48:10,603 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:48:10,603 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:48:10,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2020-06-22 10:48:10,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 10:48:10,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:48:10,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:48:10,619 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:48:10,619 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:48:10,619 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:48:10,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2020-06-22 10:48:10,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 10:48:10,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:48:10,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:48:10,623 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:48:10,623 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:48:10,628 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRYtrue [103] 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] 18#L-1true [169] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 13#L9true [115] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 10#L9-1true [111] L9-1-->L11-2: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 14#L11-2true [2020-06-22 10:48:10,630 INFO L796 eck$LassoCheckResult]: Loop: 14#L11-2true [91] L11-2-->L11: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 37#L11true [105] L11-->L12: Formula: (<= 0 |v_ULTIMATE.start_test_fun_#t~mem2_6|) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_6|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 21#L12true [124] L12-->L13-3: Formula: (and (= (store |v_#memory_int_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_6 (store (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 1)) |v_#memory_int_6|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 34#L13-3true [128] L13-3-->L13: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 41#L13true [133] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 39#L13-1true [156] L13-1-->L13-4: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem4_4| |v_ULTIMATE.start_test_fun_#t~mem3_4|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_4|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_4|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 15#L13-4true [118] L13-4-->L20: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_24|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_29|} OutVars{#valid=|v_#valid_29|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_24|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 17#L20true [225] L20-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_31| v_ULTIMATE.start_test_fun_~x_ref~0.base_21)) (= |v_#memory_int_20| (store |v_#memory_int_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_21 (store (select |v_#memory_int_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| (- 1))))) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (= (select |v_#valid_40| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) 1)) InVars {#valid=|v_#valid_40|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_31|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21} OutVars{#valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_31|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 14#L11-2true [2020-06-22 10:48:10,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:10,631 INFO L82 PathProgramCache]: Analyzing trace with hash 4158079, now seen corresponding path program 1 times [2020-06-22 10:48:10,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:10,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:10,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:10,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:10,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:10,677 INFO L82 PathProgramCache]: Analyzing trace with hash 245443477, now seen corresponding path program 1 times [2020-06-22 10:48:10,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:10,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:10,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:10,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:10,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:10,702 INFO L82 PathProgramCache]: Analyzing trace with hash -755154925, now seen corresponding path program 1 times [2020-06-22 10:48:10,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:10,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:10,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:10,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:11,027 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2020-06-22 10:48:11,127 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:48:11,129 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:48:11,129 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:48:11,129 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:48:11,129 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:48:11,130 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:48:11,130 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:48:11,130 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:48:11,130 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 10:48:11,130 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:48:11,130 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:48:11,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:11,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:11,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 10:48:11,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:11,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:11,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 10:48:11,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:11,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:11,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:11,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:11,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 10:48:11,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 10:48:11,405 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2020-06-22 10:48:11,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:11,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:11,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:11,764 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:48:11,770 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:48:11,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:11,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:11,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:11,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:11,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:11,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:11,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:11,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:11,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:11,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:11,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:11,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:11,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:11,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:11,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:11,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:11,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:11,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:11,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:11,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:11,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:11,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:11,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:11,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:11,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:11,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:11,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:11,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:11,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:11,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:11,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:11,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:11,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:11,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:11,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:11,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:11,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:11,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:11,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:11,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:11,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:11,790 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:48:11,790 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:48:11,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:11,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:11,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:11,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:11,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:11,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:11,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:11,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:11,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:11,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:11,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:11,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:11,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:11,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:11,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:11,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:48:11,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:48:11,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:11,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:11,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:11,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:11,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:11,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:11,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:11,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:11,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:11,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:11,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:11,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:11,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:11,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:11,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:11,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:48:11,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:48:11,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:11,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:11,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:11,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:11,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:11,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:11,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:11,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:11,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:11,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:11,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:11,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:11,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:11,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:11,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:11,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:11,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:11,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:11,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:11,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:11,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:11,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:11,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:11,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:11,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:48:11,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:48:11,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:11,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:11,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:11,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:11,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:11,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:11,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:48:11,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:48:11,857 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:48:11,866 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:48:11,867 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 10:48:11,869 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:48:11,870 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:48:11,871 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:48:11,871 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 1 Supporting invariants [] [2020-06-22 10:48:11,903 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 10:48:11,907 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:48:11,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:11,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:48:11,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:11,991 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 10:48:11,992 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:48:11,997 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:48:11,998 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:48:11,998 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2020-06-22 10:48:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:12,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:48:12,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:12,059 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2020-06-22 10:48:12,060 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:48:12,070 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:48:12,071 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:48:12,071 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2020-06-22 10:48:12,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:48:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:12,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:48:12,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:12,257 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2020-06-22 10:48:12,258 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:48:12,268 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:48:12,270 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:48:12,270 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:21 [2020-06-22 10:48:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:12,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:48:12,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:12,414 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2020-06-22 10:48:12,415 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:48:12,424 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:48:12,425 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:48:12,426 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:21 [2020-06-22 10:48:12,462 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2020-06-22 10:48:12,463 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:48:12,474 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:48:12,476 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 10:48:12,476 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2020-06-22 10:48:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:12,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:48:12,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:12,532 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2020-06-22 10:48:12,533 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:48:12,541 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:48:12,543 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:48:12,543 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:21 [2020-06-22 10:48:12,575 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2020-06-22 10:48:12,576 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:48:12,585 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:48:12,586 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 10:48:12,587 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2020-06-22 10:48:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:12,600 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:48:12,600 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-22 10:48:12,604 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2020-06-22 10:48:12,605 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 44 states. Second operand 7 states. [2020-06-22 10:48:13,319 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 44 states.. Second operand 7 states. Result 151 states and 259 transitions. Complement of second has 20 states. [2020-06-22 10:48:13,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 8 non-accepting loop states 2 accepting loop states [2020-06-22 10:48:13,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 10:48:13,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 193 transitions. [2020-06-22 10:48:13,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 193 transitions. Stem has 4 letters. Loop has 8 letters. [2020-06-22 10:48:13,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:13,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 193 transitions. Stem has 12 letters. Loop has 8 letters. [2020-06-22 10:48:13,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:13,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 193 transitions. Stem has 4 letters. Loop has 16 letters. [2020-06-22 10:48:13,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:13,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 259 transitions. [2020-06-22 10:48:13,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:48:13,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 47 states and 55 transitions. [2020-06-22 10:48:13,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 10:48:13,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-06-22 10:48:13,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 55 transitions. [2020-06-22 10:48:13,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:48:13,367 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 55 transitions. [2020-06-22 10:48:13,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 55 transitions. [2020-06-22 10:48:13,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2020-06-22 10:48:13,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 10:48:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2020-06-22 10:48:13,370 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-06-22 10:48:13,370 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-06-22 10:48:13,370 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:48:13,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2020-06-22 10:48:13,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:48:13,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:48:13,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:48:13,372 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:48:13,372 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:48:13,373 INFO L794 eck$LassoCheckResult]: Stem: 429#ULTIMATE.startENTRY [103] 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] 426#L-1 [169] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 425#L9 [115] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 418#L9-1 [111] L9-1-->L11-2: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 419#L11-2 [91] L11-2-->L11: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 421#L11 [105] L11-->L12: Formula: (<= 0 |v_ULTIMATE.start_test_fun_#t~mem2_6|) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_6|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 430#L12 [124] L12-->L13-3: Formula: (and (= (store |v_#memory_int_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_6 (store (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 1)) |v_#memory_int_6|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 413#L13-3 [2020-06-22 10:48:13,374 INFO L796 eck$LassoCheckResult]: Loop: 413#L13-3 [128] L13-3-->L13: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 427#L13 [133] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 432#L13-1 [132] L13-1-->L14: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 433#L14 [98] L14-->L14-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) (= 1 (select |v_#valid_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 436#L14-1 [159] L14-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem5_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 416#L18 [84] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= 1 (select |v_#valid_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 412#L18-1 [227] L18-1-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_18) (= (store |v_#memory_int_24| v_ULTIMATE.start_test_fun_~y_ref~0.base_25 (store (select |v_#memory_int_24| v_ULTIMATE.start_test_fun_~y_ref~0.base_25) v_ULTIMATE.start_test_fun_~y_ref~0.offset_18 (* 2 |v_ULTIMATE.start_test_fun_#t~mem7_6|))) |v_#memory_int_23|) (= 1 (select |v_#valid_43| v_ULTIMATE.start_test_fun_~y_ref~0.base_25)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_18 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~y_ref~0.base_25))) InVars {#valid=|v_#valid_43|, #memory_int=|v_#memory_int_24|, #length=|v_#length_33|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_25, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_18, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_43|, #memory_int=|v_#memory_int_23|, #length=|v_#length_33|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_25, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_18, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 413#L13-3 [2020-06-22 10:48:13,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:13,375 INFO L82 PathProgramCache]: Analyzing trace with hash -680629265, now seen corresponding path program 1 times [2020-06-22 10:48:13,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:13,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:13,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:13,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:13,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:13,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:13,398 INFO L82 PathProgramCache]: Analyzing trace with hash -983145782, now seen corresponding path program 1 times [2020-06-22 10:48:13,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:13,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:13,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:13,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:13,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:13,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:13,411 INFO L82 PathProgramCache]: Analyzing trace with hash 122769180, now seen corresponding path program 1 times [2020-06-22 10:48:13,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:13,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:13,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:13,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:13,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:13,719 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2020-06-22 10:48:13,811 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:48:13,812 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:48:13,812 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:48:13,812 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:48:13,812 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:48:13,812 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:48:13,812 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:48:13,812 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:48:13,813 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 10:48:13,813 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:48:13,813 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:48:13,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:13,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:13,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:13,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:13,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:13,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:13,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:13,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:13,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:13,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:13,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:14,010 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2020-06-22 10:48:14,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:14,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:14,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:14,368 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:48:14,368 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:48:14,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:14,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:14,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:14,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:14,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:14,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:14,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:14,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:14,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:14,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:14,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:14,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:14,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:14,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:14,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:14,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:14,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:14,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:14,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:14,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:14,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:14,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:14,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:14,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:48:14,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:48:14,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:14,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:14,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:14,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:14,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:14,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:14,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:14,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:14,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:14,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:14,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:14,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:14,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:14,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:14,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:14,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:14,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:14,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:14,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:14,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:14,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:14,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:14,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:14,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:14,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:14,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:14,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:14,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:14,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:14,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:14,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:14,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:14,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:14,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:48:14,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:48:14,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:14,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:14,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:14,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:14,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:14,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:14,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:14,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:14,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:14,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:14,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:14,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:14,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:14,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:14,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:14,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:14,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:14,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:14,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:14,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:14,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:14,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:14,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:14,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:14,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:14,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:14,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:14,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:14,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:14,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:14,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:14,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:14,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:14,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:48:14,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:48:14,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:14,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:14,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:14,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:14,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:14,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:14,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:48:14,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:48:14,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:14,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:14,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:14,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:14,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:14,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:14,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:48:14,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:48:14,437 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:48:14,463 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 10:48:14,463 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 10:48:14,464 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:48:14,465 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:48:14,465 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:48:14,465 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2020-06-22 10:48:14,495 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 10:48:14,497 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:48:14,497 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:48:14,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:14,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:48:14,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:14,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 10:48:14,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:48:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:14,800 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:48:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:14,810 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:48:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:14,822 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:48:14,822 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-22 10:48:14,822 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2020-06-22 10:48:14,822 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 26 states and 32 transitions. cyclomatic complexity: 8 Second operand 8 states. [2020-06-22 10:48:15,041 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 26 states and 32 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 41 states and 48 transitions. Complement of second has 14 states. [2020-06-22 10:48:15,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2020-06-22 10:48:15,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 10:48:15,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2020-06-22 10:48:15,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 7 letters. Loop has 7 letters. [2020-06-22 10:48:15,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:15,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 14 letters. Loop has 7 letters. [2020-06-22 10:48:15,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:15,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 7 letters. Loop has 14 letters. [2020-06-22 10:48:15,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:15,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 48 transitions. [2020-06-22 10:48:15,050 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:48:15,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2020-06-22 10:48:15,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:48:15,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:48:15,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:48:15,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:48:15,050 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:48:15,050 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:48:15,051 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:48:15,051 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:48:15,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:48:15,051 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:48:15,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:48:15,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:48:15 BasicIcfg [2020-06-22 10:48:15,058 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:48:15,058 INFO L168 Benchmark]: Toolchain (without parser) took 6478.87 ms. Allocated memory was 649.6 MB in the beginning and 769.7 MB in the end (delta: 120.1 MB). Free memory was 564.2 MB in the beginning and 408.8 MB in the end (delta: 155.4 MB). Peak memory consumption was 275.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:48:15,060 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:48:15,061 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.41 ms. Allocated memory was 649.6 MB in the beginning and 687.9 MB in the end (delta: 38.3 MB). Free memory was 564.2 MB in the beginning and 651.4 MB in the end (delta: -87.2 MB). Peak memory consumption was 28.9 MB. Max. memory is 50.3 GB. [2020-06-22 10:48:15,061 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.86 ms. Allocated memory is still 687.9 MB. Free memory was 651.4 MB in the beginning and 648.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 10:48:15,062 INFO L168 Benchmark]: Boogie Preprocessor took 23.24 ms. Allocated memory is still 687.9 MB. Free memory was 648.7 MB in the beginning and 647.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:48:15,062 INFO L168 Benchmark]: RCFGBuilder took 345.06 ms. Allocated memory is still 687.9 MB. Free memory was 647.3 MB in the beginning and 622.2 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:48:15,063 INFO L168 Benchmark]: BlockEncodingV2 took 146.45 ms. Allocated memory is still 687.9 MB. Free memory was 622.2 MB in the beginning and 612.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:48:15,063 INFO L168 Benchmark]: TraceAbstraction took 1138.40 ms. Allocated memory is still 687.9 MB. Free memory was 611.4 MB in the beginning and 499.6 MB in the end (delta: 111.8 MB). Peak memory consumption was 111.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:48:15,064 INFO L168 Benchmark]: BuchiAutomizer took 4488.29 ms. Allocated memory was 687.9 MB in the beginning and 769.7 MB in the end (delta: 81.8 MB). Free memory was 499.6 MB in the beginning and 408.8 MB in the end (delta: 90.8 MB). Peak memory consumption was 172.6 MB. Max. memory is 50.3 GB. [2020-06-22 10:48:15,069 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 52 locations, 56 edges - StatisticsResult: Encoded RCFG 44 locations, 74 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 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 292.41 ms. Allocated memory was 649.6 MB in the beginning and 687.9 MB in the end (delta: 38.3 MB). Free memory was 564.2 MB in the beginning and 651.4 MB in the end (delta: -87.2 MB). Peak memory consumption was 28.9 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.86 ms. Allocated memory is still 687.9 MB. Free memory was 651.4 MB in the beginning and 648.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.24 ms. Allocated memory is still 687.9 MB. Free memory was 648.7 MB in the beginning and 647.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 345.06 ms. Allocated memory is still 687.9 MB. Free memory was 647.3 MB in the beginning and 622.2 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 146.45 ms. Allocated memory is still 687.9 MB. Free memory was 622.2 MB in the beginning and 612.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1138.40 ms. Allocated memory is still 687.9 MB. Free memory was 611.4 MB in the beginning and 499.6 MB in the end (delta: 111.8 MB). Peak memory consumption was 111.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 4488.29 ms. Allocated memory was 687.9 MB in the beginning and 769.7 MB in the end (delta: 81.8 MB). Free memory was 499.6 MB in the beginning and 408.8 MB in the end (delta: 90.8 MB). Peak memory consumption was 172.6 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 * 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: 14]: 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: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: 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: 18]: 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: 14]: 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: 20]: 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: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: 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: 18]: 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: 11]: 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: 22]: 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: 10]: 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 - AllSpecificationsHoldResult: All specifications hold 26 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-06-22 10:48:15,078 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:15,079 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:15,079 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:15,079 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((4 == unknown-#length-unknown[x_ref] && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0 - InvariantResult [Line: 10]: Loop Invariant [2020-06-22 10:48:15,080 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:15,080 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:15,081 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:15,081 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((4 == unknown-#length-unknown[x_ref] && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 26 error locations. SAFE Result, 1.0s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 197 SDslu, 3 SDs, 0 SdLazy, 202 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 2 NumberOfFragments, 54 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 2 terminating modules (0 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x_ref][x_ref] + 1 and consists of 12 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.4s. Construction of modules took 0.4s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 21 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 20 SDtfs, 514 SDslu, 61 SDs, 0 SdLazy, 580 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital222 mio100 ax100 hnf100 lsp96 ukn64 mio100 lsp38 div100 bol100 ite100 ukn100 eq166 hnf90 smp92 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 10:48:05.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 10:48:15.308 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check