YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:08:07,568 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:08:07,570 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:08:07,581 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:08:07,581 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:08:07,582 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:08:07,584 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:08:07,585 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:08:07,587 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:08:07,587 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:08:07,588 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:08:07,588 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:08:07,589 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:08:07,590 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:08:07,591 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:08:07,592 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:08:07,593 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:08:07,594 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:08:07,596 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:08:07,598 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:08:07,599 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:08:07,600 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:08:07,602 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:08:07,602 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:08:07,602 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:08:07,603 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:08:07,604 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:08:07,604 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:08:07,605 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:08:07,605 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:08:07,606 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:08:07,607 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:08:07,607 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:08:07,608 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:08:07,608 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:08:07,608 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:08:07,609 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:08:07,610 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:08:07,610 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:08:07,610 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 10:08:07,625 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:08:07,625 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:08:07,626 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:08:07,626 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:08:07,626 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:08:07,626 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:08:07,626 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:08:07,627 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:08:07,627 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:08:07,627 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:08:07,627 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:08:07,627 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:08:07,627 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:08:07,628 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:08:07,628 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:08:07,628 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:08:07,628 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:08:07,628 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:08:07,628 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:08:07,629 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:08:07,629 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:08:07,629 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:08:07,629 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:08:07,629 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:08:07,629 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:08:07,630 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:08:07,630 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:08:07,630 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:08:07,630 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:08:07,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:08:07,668 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:08:07,672 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:08:07,673 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:08:07,673 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:08:07,674 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 10:08:07,775 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/5effee62c2654b548d43f0a684612928/FLAG003e32bce [2020-06-22 10:08:08,117 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:08:08,118 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 10:08:08,118 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:08:08,125 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/5effee62c2654b548d43f0a684612928/FLAG003e32bce [2020-06-22 10:08:08,515 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/5effee62c2654b548d43f0a684612928 [2020-06-22 10:08:08,527 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:08:08,528 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:08:08,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:08:08,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:08:08,533 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:08:08,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:08:08" (1/1) ... [2020-06-22 10:08:08,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11b41118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:08:08, skipping insertion in model container [2020-06-22 10:08:08,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:08:08" (1/1) ... [2020-06-22 10:08:08,545 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:08:08,561 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:08:08,722 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:08:08,735 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:08:08,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:08:08,836 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:08:08,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:08:08 WrapperNode [2020-06-22 10:08:08,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:08:08,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:08:08,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:08:08,838 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:08:08,847 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:08:08" (1/1) ... [2020-06-22 10:08:08,856 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:08:08" (1/1) ... [2020-06-22 10:08:08,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:08:08,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:08:08,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:08:08,880 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:08:08,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:08:08" (1/1) ... [2020-06-22 10:08:08,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:08:08" (1/1) ... [2020-06-22 10:08:08,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:08:08" (1/1) ... [2020-06-22 10:08:08,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:08:08" (1/1) ... [2020-06-22 10:08:08,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:08:08" (1/1) ... [2020-06-22 10:08:08,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:08:08" (1/1) ... [2020-06-22 10:08:08,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:08:08" (1/1) ... [2020-06-22 10:08:08,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:08:08,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:08:08,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:08:08,905 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:08:08,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:08: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:08:08,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:08:08,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:08:08,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:08:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:08:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:08:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:08:09,289 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:08:09,289 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 10:08:09,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:08:09 BoogieIcfgContainer [2020-06-22 10:08:09,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:08:09,291 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:08:09,291 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:08:09,294 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:08:09,294 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:08:09" (1/1) ... [2020-06-22 10:08:09,315 INFO L313 BlockEncoder]: Initial Icfg 49 locations, 52 edges [2020-06-22 10:08:09,316 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:08:09,317 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:08:09,318 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:08:09,318 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:08:09,320 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:08:09,320 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:08:09,321 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:08:09,347 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:08:09,379 INFO L200 BlockEncoder]: SBE split 25 edges [2020-06-22 10:08:09,384 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 10:08:09,386 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:08:09,414 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-06-22 10:08:09,417 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states [2020-06-22 10:08:09,420 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:08:09,420 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:08:09,422 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:08:09,423 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:08:09,424 INFO L313 BlockEncoder]: Encoded RCFG 41 locations, 68 edges [2020-06-22 10:08:09,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:08:09 BasicIcfg [2020-06-22 10:08:09,425 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:08:09,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:08:09,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:08:09,430 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:08:09,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:08:08" (1/4) ... [2020-06-22 10:08:09,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ab631e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:08:09, skipping insertion in model container [2020-06-22 10:08:09,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:08:08" (2/4) ... [2020-06-22 10:08:09,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ab631e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:08:09, skipping insertion in model container [2020-06-22 10:08:09,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:08:09" (3/4) ... [2020-06-22 10:08:09,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ab631e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:08:09, skipping insertion in model container [2020-06-22 10:08:09,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:08:09" (4/4) ... [2020-06-22 10:08:09,434 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:08:09,444 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:08:09,452 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 24 error locations. [2020-06-22 10:08:09,469 INFO L257 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2020-06-22 10:08:09,497 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:08:09,498 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:08:09,498 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:08:09,498 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:08:09,498 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:08:09,498 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:08:09,499 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:08:09,499 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:08:09,499 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:08:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2020-06-22 10:08:09,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:08:09,520 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:08:09,521 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:08:09,522 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION]=== [2020-06-22 10:08:09,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:09,527 INFO L82 PathProgramCache]: Analyzing trace with hash 115319, now seen corresponding path program 1 times [2020-06-22 10:08:09,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:09,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:09,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:09,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:09,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:09,701 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:08:09,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:08:09,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:08:09,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:08:09,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:08:09,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:08:09,724 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2020-06-22 10:08:09,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:08:09,872 INFO L93 Difference]: Finished difference Result 41 states and 68 transitions. [2020-06-22 10:08:09,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:08:09,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:08:09,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:08:09,888 INFO L225 Difference]: With dead ends: 41 [2020-06-22 10:08:09,888 INFO L226 Difference]: Without dead ends: 36 [2020-06-22 10:08:09,891 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:08:09,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-06-22 10:08:09,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-06-22 10:08:09,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-06-22 10:08:09,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-06-22 10:08:09,932 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 3 [2020-06-22 10:08:09,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:08:09,933 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-06-22 10:08:09,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:08:09,933 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-06-22 10:08:09,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:08:09,934 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:08:09,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:08:09,934 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION]=== [2020-06-22 10:08:09,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:09,934 INFO L82 PathProgramCache]: Analyzing trace with hash 115321, now seen corresponding path program 1 times [2020-06-22 10:08:09,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:09,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:09,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:09,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:09,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:09,958 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:08:09,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:08:09,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:08:09,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:08:09,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:08:09,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:08:09,961 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 3 states. [2020-06-22 10:08:10,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:08:10,042 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2020-06-22 10:08:10,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:08:10,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:08:10,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:08:10,043 INFO L225 Difference]: With dead ends: 41 [2020-06-22 10:08:10,043 INFO L226 Difference]: Without dead ends: 36 [2020-06-22 10:08:10,044 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:08:10,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-06-22 10:08:10,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-06-22 10:08:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-06-22 10:08:10,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2020-06-22 10:08:10,050 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 3 [2020-06-22 10:08:10,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:08:10,050 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2020-06-22 10:08:10,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:08:10,050 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2020-06-22 10:08:10,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:08:10,051 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:08:10,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:08:10,051 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION]=== [2020-06-22 10:08:10,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:10,052 INFO L82 PathProgramCache]: Analyzing trace with hash 115322, now seen corresponding path program 1 times [2020-06-22 10:08:10,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:10,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:10,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:10,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:10,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:10,083 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:08:10,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:08:10,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:08:10,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:08:10,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:08:10,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:08:10,084 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 3 states. [2020-06-22 10:08:10,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:08:10,179 INFO L93 Difference]: Finished difference Result 36 states and 53 transitions. [2020-06-22 10:08:10,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:08:10,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:08:10,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:08:10,180 INFO L225 Difference]: With dead ends: 36 [2020-06-22 10:08:10,180 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 10:08:10,181 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:08:10,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 10:08:10,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-06-22 10:08:10,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 10:08:10,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2020-06-22 10:08:10,185 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 48 transitions. Word has length 3 [2020-06-22 10:08:10,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:08:10,185 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 48 transitions. [2020-06-22 10:08:10,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:08:10,186 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 48 transitions. [2020-06-22 10:08:10,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:08:10,186 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:08:10,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:08:10,186 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION]=== [2020-06-22 10:08:10,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:10,187 INFO L82 PathProgramCache]: Analyzing trace with hash 3573747, now seen corresponding path program 1 times [2020-06-22 10:08:10,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:10,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:10,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:10,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:10,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:10,219 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:08:10,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:08:10,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:08:10,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:08:10,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:08:10,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:08:10,220 INFO L87 Difference]: Start difference. First operand 31 states and 48 transitions. Second operand 3 states. [2020-06-22 10:08:10,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:08:10,290 INFO L93 Difference]: Finished difference Result 31 states and 48 transitions. [2020-06-22 10:08:10,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:08:10,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:08:10,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:08:10,292 INFO L225 Difference]: With dead ends: 31 [2020-06-22 10:08:10,292 INFO L226 Difference]: Without dead ends: 24 [2020-06-22 10:08:10,292 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:08:10,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-06-22 10:08:10,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-06-22 10:08:10,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 10:08:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2020-06-22 10:08:10,296 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 4 [2020-06-22 10:08:10,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:08:10,296 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2020-06-22 10:08:10,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:08:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2020-06-22 10:08:10,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:08:10,297 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:08:10,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:08:10,297 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION]=== [2020-06-22 10:08:10,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:10,298 INFO L82 PathProgramCache]: Analyzing trace with hash 3573745, now seen corresponding path program 1 times [2020-06-22 10:08:10,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:10,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:10,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:10,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:10,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:10,324 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:08:10,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:08:10,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:08:10,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:08:10,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:08:10,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:08:10,325 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 3 states. [2020-06-22 10:08:10,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:08:10,383 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2020-06-22 10:08:10,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:08:10,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:08:10,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:08:10,384 INFO L225 Difference]: With dead ends: 24 [2020-06-22 10:08:10,384 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:08:10,385 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:08:10,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:08:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:08:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:08:10,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:08:10,386 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2020-06-22 10:08:10,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:08:10,386 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:08:10,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:08:10,386 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:08:10,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:08:10,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:08:10,418 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:08:10,418 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 10:08:10,418 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:08:10,418 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:08:10,419 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:08:10,419 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-06-22 10:08:10,419 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:08:10,419 INFO L448 ceAbstractionStarter]: For program point L15-2(lines 15 21) no Hoare annotation was computed. [2020-06-22 10:08:10,419 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 10:08:10,419 INFO L448 ceAbstractionStarter]: For program point L11(lines 11 14) no Hoare annotation was computed. [2020-06-22 10:08:10,420 INFO L444 ceAbstractionStarter]: At program point L15-4(lines 15 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:08:10,420 INFO L448 ceAbstractionStarter]: For program point L15-5(lines 15 21) no Hoare annotation was computed. [2020-06-22 10:08:10,420 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:08:10,420 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:08:10,420 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:08:10,421 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:08:10,421 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:08:10,421 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 10:08:10,421 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:08:10,421 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2020-06-22 10:08:10,421 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-06-22 10:08:10,421 INFO L448 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. [2020-06-22 10:08:10,421 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2020-06-22 10:08:10,422 INFO L448 ceAbstractionStarter]: For program point L16-1(lines 16 19) no Hoare annotation was computed. [2020-06-22 10:08:10,422 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:08:10,422 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 10:08:10,422 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:08:10,422 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:08:10,422 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:08:10,422 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:08:10,422 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 10:08:10,422 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 10:08:10,423 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:08:10,423 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2020-06-22 10:08:10,423 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:08:10,423 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-06-22 10:08:10,423 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:08:10,423 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:08:10,423 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:08:10,423 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2020-06-22 10:08:10,423 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2020-06-22 10:08:10,424 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:08:10,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:08:10,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:08:10,440 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:08:10,440 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:08:10,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:08:10 BasicIcfg [2020-06-22 10:08:10,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:08:10,443 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:08:10,443 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:08:10,447 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:08:10,447 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:08:10,447 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:08:08" (1/5) ... [2020-06-22 10:08:10,448 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64424c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:08:10, skipping insertion in model container [2020-06-22 10:08:10,448 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:08:10,448 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:08:08" (2/5) ... [2020-06-22 10:08:10,448 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64424c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:08:10, skipping insertion in model container [2020-06-22 10:08:10,449 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:08:10,449 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:08:09" (3/5) ... [2020-06-22 10:08:10,449 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64424c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:08:10, skipping insertion in model container [2020-06-22 10:08:10,449 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:08:10,449 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:08:09" (4/5) ... [2020-06-22 10:08:10,450 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64424c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:08:10, skipping insertion in model container [2020-06-22 10:08:10,450 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:08:10,450 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:08:10" (5/5) ... [2020-06-22 10:08:10,451 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:08:10,473 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:08:10,473 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:08:10,473 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:08:10,473 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:08:10,473 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:08:10,473 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:08:10,474 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:08:10,474 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:08:10,474 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:08:10,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states. [2020-06-22 10:08:10,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 10:08:10,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:08:10,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:08:10,489 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:08:10,490 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:08:10,490 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:08:10,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states. [2020-06-22 10:08:10,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 10:08:10,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:08:10,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:08:10,493 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:08:10,493 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:08:10,499 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue [84] 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] 16#L-1true [153] 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) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= (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_~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~nondet11_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_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_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_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_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_test_fun_#t~mem10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, 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_test_fun_#t~malloc0.base, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 13#L9true [112] 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] 11#L9-1true [106] L9-1-->L10: 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] 17#L10true [75] L10-->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] 35#L11true [129] L11-->L15-4: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem2_6| 0) 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] 36#L15-4true [2020-06-22 10:08:10,501 INFO L796 eck$LassoCheckResult]: Loop: 36#L15-4true [88] L15-4-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1) (<= (+ 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)) (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_7|, 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_17|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, 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~mem4] 42#L15-1true [94] L15-1-->L15-2: 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) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem5_2|)) InVars {#memory_int=|v_#memory_int_8|, #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_19|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, #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~mem5] 41#L15-2true [93] L15-2-->L16: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem5_6| |v_ULTIMATE.start_test_fun_#t~mem4_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5] 5#L16true [99] L16-->L16-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= (select |v_#valid_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_16|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_16|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 3#L16-1true [141] L16-1-->L20: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem6_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 14#L20true [115] L20-->L20-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= 1 (select |v_#valid_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= (select (select |v_#memory_int_11| 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~mem8_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_11|, #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_28|} OutVars{#valid=|v_#valid_28|, #memory_int=|v_#memory_int_11|, #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_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 12#L20-1true [109] L20-1-->L20-2: Formula: (and (= (select |v_#valid_30| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_30|} OutVars{#valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 9#L20-2true [207] L20-2-->L15-4: Formula: (and (= (select |v_#valid_45| v_ULTIMATE.start_test_fun_~y_ref~0.base_27) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_20 4) (select |v_#length_31| v_ULTIMATE.start_test_fun_~y_ref~0.base_27)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_20) (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_test_fun_~y_ref~0.base_27 (store (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~y_ref~0.base_27) v_ULTIMATE.start_test_fun_~y_ref~0.offset_20 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| |v_ULTIMATE.start_test_fun_#t~mem8_6|))))) InVars {#valid=|v_#valid_45|, #memory_int=|v_#memory_int_20|, #length=|v_#length_31|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_27, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_20} OutVars{#valid=|v_#valid_45|, #memory_int=|v_#memory_int_19|, #length=|v_#length_31|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_27, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_20} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9] 36#L15-4true [2020-06-22 10:08:10,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:10,502 INFO L82 PathProgramCache]: Analyzing trace with hash -857875306, now seen corresponding path program 1 times [2020-06-22 10:08:10,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:10,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:10,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:10,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:10,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:10,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:10,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1520254005, now seen corresponding path program 1 times [2020-06-22 10:08:10,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:10,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:10,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:10,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:10,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:10,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:10,581 INFO L82 PathProgramCache]: Analyzing trace with hash 364098506, now seen corresponding path program 1 times [2020-06-22 10:08:10,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:08:10,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:08:10,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:10,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:08:10,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:08:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:10,936 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2020-06-22 10:08:11,047 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:08:11,048 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:08:11,048 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:08:11,049 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:08:11,049 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:08:11,049 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:08:11,049 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:08:11,049 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:08:11,049 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 10:08:11,050 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:08:11,050 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:08:11,071 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:08:11,086 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:08:11,089 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:08:11,091 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:08:11,096 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:08:11,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:08:11,100 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:08:11,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:08:11,104 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:08:11,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:08:11,108 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:08:11,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:08:11,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:08:11,114 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:08:11,116 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:08:11,118 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:08:11,120 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:08:11,324 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2020-06-22 10:08:11,686 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:08:11,692 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:08:11,694 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:08:11,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:11,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:11,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:11,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:11,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:11,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:11,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:11,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:11,702 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:08:11,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:11,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:11,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:11,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:11,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:11,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:11,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:11,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:11,704 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:08:11,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:11,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:11,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:11,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:11,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:11,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:11,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:11,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:11,707 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:08:11,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:11,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:11,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:11,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:11,710 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:11,710 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:11,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:11,714 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:08:11,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:11,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:11,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:11,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:11,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:11,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:11,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:11,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:11,716 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:08:11,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:11,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:11,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:11,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:11,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:11,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:11,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:11,723 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:08:11,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:11,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:11,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:11,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:11,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:11,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:11,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:11,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:11,725 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:08:11,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:11,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:11,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:11,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:11,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:11,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:11,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:11,731 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:08:11,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:11,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:11,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:11,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:11,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:11,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:11,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:11,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:11,733 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:08:11,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:11,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:11,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:11,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:11,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:11,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:11,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:11,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:11,736 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:08:11,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:11,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:11,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:11,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:11,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:11,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:11,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:11,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:11,739 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:08:11,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:11,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:11,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:11,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:11,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:11,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:11,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:11,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:11,741 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:08:11,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:11,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:11,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:11,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:11,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:11,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:11,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:11,747 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:08:11,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:11,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:11,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:11,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:11,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:11,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:11,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:11,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:11,749 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:08:11,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:11,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:11,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:11,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:11,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:11,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:11,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:11,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:11,752 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:08:11,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:11,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:08:11,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:11,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:11,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:11,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:08:11,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:08:11,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:11,755 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:08:11,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:11,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:11,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:11,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:11,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:11,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:11,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:11,776 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:08:11,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:11,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:11,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:11,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:11,778 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:11,778 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:11,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:11,788 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:08:11,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:11,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:11,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:11,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:11,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:11,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:11,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:08:11,812 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:08:11,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:08:11,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:08:11,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:08:11,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:08:11,816 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:08:11,816 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:08:11,841 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:08:11,861 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:08:11,862 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 10:08:11,864 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:08:11,866 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:08:11,866 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:08:11,866 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, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2020-06-22 10:08:11,898 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 10:08:11,901 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:08:11,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:08:11,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:08:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:11,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:08:11,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:08:11,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:08:11,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:08:12,084 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:08:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:12,240 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:08:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:12,249 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:08:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:12,258 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:08:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:08:12,269 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:08:12,269 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 10:08:12,273 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 8 loop predicates [2020-06-22 10:08:12,274 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 41 states. Second operand 9 states. [2020-06-22 10:08:12,871 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 41 states.. Second operand 9 states. Result 99 states and 163 transitions. Complement of second has 27 states. [2020-06-22 10:08:12,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 12 non-accepting loop states 2 accepting loop states [2020-06-22 10:08:12,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 10:08:12,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 138 transitions. [2020-06-22 10:08:12,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 138 transitions. Stem has 6 letters. Loop has 8 letters. [2020-06-22 10:08:12,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:08:12,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 138 transitions. Stem has 14 letters. Loop has 8 letters. [2020-06-22 10:08:12,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:08:12,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 138 transitions. Stem has 6 letters. Loop has 16 letters. [2020-06-22 10:08:12,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:08:12,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 163 transitions. [2020-06-22 10:08:12,893 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:08:12,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 0 states and 0 transitions. [2020-06-22 10:08:12,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:08:12,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:08:12,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:08:12,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:08:12,896 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:08:12,896 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:08:12,896 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:08:12,896 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:08:12,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:08:12,896 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:08:12,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:08:12,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:08:12 BasicIcfg [2020-06-22 10:08:12,902 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:08:12,903 INFO L168 Benchmark]: Toolchain (without parser) took 4375.50 ms. Allocated memory was 649.6 MB in the beginning and 752.4 MB in the end (delta: 102.8 MB). Free memory was 565.1 MB in the beginning and 409.2 MB in the end (delta: 155.8 MB). Peak memory consumption was 258.6 MB. Max. memory is 50.3 GB. [2020-06-22 10:08:12,904 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:08:12,904 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.54 ms. Allocated memory was 649.6 MB in the beginning and 690.0 MB in the end (delta: 40.4 MB). Free memory was 565.1 MB in the beginning and 656.7 MB in the end (delta: -91.6 MB). Peak memory consumption was 30.9 MB. Max. memory is 50.3 GB. [2020-06-22 10:08:12,905 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.66 ms. Allocated memory is still 690.0 MB. Free memory was 656.7 MB in the beginning and 652.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. [2020-06-22 10:08:12,905 INFO L168 Benchmark]: Boogie Preprocessor took 24.22 ms. Allocated memory is still 690.0 MB. Free memory was 652.8 MB in the beginning and 651.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:08:12,906 INFO L168 Benchmark]: RCFGBuilder took 386.21 ms. Allocated memory is still 690.0 MB. Free memory was 651.7 MB in the beginning and 626.3 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:08:12,907 INFO L168 Benchmark]: BlockEncodingV2 took 133.97 ms. Allocated memory is still 690.0 MB. Free memory was 626.3 MB in the beginning and 616.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:08:12,907 INFO L168 Benchmark]: TraceAbstraction took 1016.50 ms. Allocated memory is still 690.0 MB. Free memory was 615.4 MB in the beginning and 509.7 MB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 50.3 GB. [2020-06-22 10:08:12,908 INFO L168 Benchmark]: BuchiAutomizer took 2459.28 ms. Allocated memory was 690.0 MB in the beginning and 752.4 MB in the end (delta: 62.4 MB). Free memory was 509.7 MB in the beginning and 409.2 MB in the end (delta: 100.5 MB). Peak memory consumption was 162.9 MB. Max. memory is 50.3 GB. [2020-06-22 10:08:12,912 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 49 locations, 52 edges - StatisticsResult: Encoded RCFG 41 locations, 68 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 307.54 ms. Allocated memory was 649.6 MB in the beginning and 690.0 MB in the end (delta: 40.4 MB). Free memory was 565.1 MB in the beginning and 656.7 MB in the end (delta: -91.6 MB). Peak memory consumption was 30.9 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 42.66 ms. Allocated memory is still 690.0 MB. Free memory was 656.7 MB in the beginning and 652.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.22 ms. Allocated memory is still 690.0 MB. Free memory was 652.8 MB in the beginning and 651.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 386.21 ms. Allocated memory is still 690.0 MB. Free memory was 651.7 MB in the beginning and 626.3 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 133.97 ms. Allocated memory is still 690.0 MB. Free memory was 626.3 MB in the beginning and 616.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1016.50 ms. Allocated memory is still 690.0 MB. Free memory was 615.4 MB in the beginning and 509.7 MB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2459.28 ms. Allocated memory was 690.0 MB in the beginning and 752.4 MB in the end (delta: 62.4 MB). Free memory was 509.7 MB in the beginning and 409.2 MB in the end (delta: 100.5 MB). Peak memory consumption was 162.9 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: 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: 15]: 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: 16]: 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: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: 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: 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: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: 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: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant [2020-06-22 10:08:12,921 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:08:12,921 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:08:12,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:08:12,922 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, 41 locations, 24 error locations. SAFE Result, 0.9s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 186 SDslu, 3 SDs, 0 SdLazy, 191 SolverSat, 58 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=41occurred 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, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 27 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 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 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13 SDtfs, 183 SDslu, 7 SDs, 0 SdLazy, 570 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital207 mio100 ax100 hnf100 lsp94 ukn70 mio100 lsp37 div100 bol100 ite100 ukn100 eq153 hnf91 smp91 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 10:08:05.260 ----------------------------------------------- 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:08:13.150 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check